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