A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
General factors are a generalization of matchings. Given a graph G with a set π(v) of feasible degrees, called a degree constraint, for each vertex v of G, the general factor problem is to find a (spanning) subgraph F of G such that degF (v) ∈ π(v) for every v of G. When all degree constraints are s...
| Main Authors: | , |
|---|---|
| 格式: | Conference item |
| 语言: | English |
| 出版: |
Schloss-Dagstuhl - Leibniz Zentrum für Informatik
2023
|