Blocking trails for \(f\)-factors of multigraphs

DOI10.1007/s00453-023-01126-yarXiv2112.04096OpenAlexW4376505282MaRDI QIDQ6046949

Harold N. Gabow

Publication date: 6 October 2023

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

multigraphgraphmatching\(f\)-factordegree-constrained subgraph\(f\)-matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Matching theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
• Network Flow and Testing Graph Connectivity
• Faster scaling algorithms for general graph matching problems
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• A Data Structure for Nearest Common Ancestors with Linking
• The Weighted Matching Approach to Maximum Cardinality Matching
• Faster Scaling Algorithms for Network Problems
• Paths, Trees, and Flowers
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Blocking trails for \(f\)-factors of multigraphs