Ara
Toplam kayıt 5, listelenen: 1-5
A short proof of the size of edge-extremal chordal graphs
(Mahmut Akyiğit, 2022-08-30)
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than d and the matching number at most ν by exhibiting a family of chordal graphs achieving this bound. ...
On the online coalition structure generation problem
(AI Access Foundationusc Information Sciences Inst, 2021)
We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority ...
Distribution games: a new class of games with application to user provided networks
(Institute of Electrical and Electronics Engineers Inc., 2022-11-29)
User Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure. In UPNs, it is an important problem to decide how ...
Hierarchical b-Matching
(Springer Science and Business Media Deutschland GmbH, 2021)
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a b-matching every vertex v has an associated bound bv, and a maximum ...
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04)
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ...