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

DOI10.1145/3183369zbMATH Open1454.68030arXiv1611.07541OpenAlexW2551688242MaRDI QIDQ4554367

Author name not available (Why is that?)

Publication date: 13 November 2018

Published in: (Search for Journal in Brave)

Abstract: This paper shows the weighted matching problem on general graphs can be solved in time $O(n(m+nlogn))$ 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 paper 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(minb(V),nlogn(m+nlogn))$ and for $f$-factors the time is $O(minf(V),mlogn(m+nlogn))$, where $b(V)$ and $f(V)$ denote the sum of all degree constraints. Several immediate applications of the $f$-factor algorithm are given: The generalized shortest path structure of cite{GS13}, i.e., the analog of the shortest path 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+nlogn))$ for $N$ the set of negative edges ($0<|N|<n$). A shortest $T$-join is found in time $O(n(m+nlogn))$, or $O(|T|(m+nlogn))$ 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.

Full work available at URL: https://arxiv.org/abs/1611.07541

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Data Structures for Weighted Matching and Extensions to b -matching and f -factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554367)