A Weight-Scaling Algorithm for f-Factors of Multigraphs
The challenge for graph matching algorithms is to extend known time bounds for bipartite graphs to general graphs. We discuss combinatorial algorithms for finding a maximum weight f-factor on an arbitrary multigraph, for given integral weights of magnitude at most W. (An f-factor is a subgraph whose...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2023
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |