EUVIMEDEUVIMED entdecken
Crossref

Data Structures for Weighted Matching and Extensions to b -matching and f -factors

Harold N. Gabow

ACM Transactions on Algorithms · 31.07.2018 · 14 (3) · 1-80

DOI: 10.1145/3183369 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Algorithms, online erschienen am 22.06.2018. Verfasst von Harold N. Gabow. Die Arbeit wurde bisher 28-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This article shows the weighted matching problem on general graphs can be solved in time O ( n ( m + n log n )) for n and m the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a data structure for blossom creation. It uses a dynamic nearest-common-ancestor algorithm to simplify blossom steps, so they involve only back edges rather than arbitrary nontree edges. The rest of the article presents direct extensions of Edmonds’ blossom algorithm to weighted b -matching and f -factors. Again, the time bound is the one previously known for bipartite graphs: for b -matching the time is O (min { b ( V ), n log n }( m + n log n )), and for f -factors the time is O (min { f ( V ), m log n }( m + n log n )), where b ( V ) and f ( V ) both denote the sum of all degree constraints. Several immediate applications of the f -factor algorithm are given: The generalized shortest path structure of Reference [19], i.e., the analog of the shortest-paths tree for conservative undirected graphs, is shown to be a version of the blossom structure for f -factors. This structure is found in time O (| N |( m + n log n )) for N , the set of negative edges (0 < | N | < n ). A shortest T -join is found in time O ( n ( m + n log n )) or O (| T |( m + n log n )) when all costs are nonnegative. These bounds are all slight improvements of previously known ones, and are simply achieved by proper initialization of the f -factor algorithm.

Förderung

  • National Science Foundation

Zitieren

APA

Gabow, H. N. (2018). Data Structures for Weighted Matching and Extensions to b -matching and f -factors. ACM Transactions on Algorithms, 14(3), 1-80. https://doi.org/10.1145/3183369

Vancouver

Gabow HN. Data Structures for Weighted Matching and Extensions to b -matching and f -factors. ACM Transactions on Algorithms. 2018;14(3):1-80. doi:10.1145/3183369

BibTeX
@article{Gabow2018,
  author = {Gabow, Harold N.},
  title = {Data Structures for Weighted Matching and Extensions to b -matching and f -factors},
  journal = {ACM Transactions on Algorithms},
  year = {2018},
  volume = {14},
  number = {3},
  pages = {1--80},
  doi = {10.1145/3183369}
}
Kostenlos starten →