Ara
Toplam kayıt 2, listelenen: 1-2
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 ...
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 ...