Combinatorial algorithms for matchings, even factors and square-free 2-factors
DOI10.1007/S10107-006-0053-9zbMATH Open1192.05122OpenAlexW2019720686MaRDI QIDQ877189FDOQ877189
Authors: Gyula Pap 
Publication date: 19 April 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0053-9
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Paths, Trees, and Flowers
- Restricted \(t\)-matchings in bipartite graphs
- Minimal edge-coverings of pairs of sets
- Finding maximum square-free 2-matchings in bipartite graphs
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- An algebraic matching algorithm
- The optimal path-matching problem
- Note on the path‐matching formula
- On the maximum even factor in weakly symmetric graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- A weighted even factor algorithm
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Title not available (Why is that?)
- Even factors, jump systems, and discrete convexity
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
- A weighted independent even factor algorithm
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Finding triangle-free 2-factors in general graphs
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles
This page was built for publication: Combinatorial algorithms for matchings, even factors and square-free 2-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877189)
