Improved algorithms for even factors and square-free simple \(b\)-matchings
From MaRDI portal
Publication:1934309
DOI10.1007/s00453-012-9642-6zbMath1257.05050OpenAlexW2127316372MaRDI QIDQ1934309
Publication date: 28 January 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9642-6
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (6)
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum even factor in weakly symmetric graphs
- The perfectly matchable subgraph polytope of an arbitrary graph
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- A weighted even factor algorithm
- The optimal path-matching problem
- Matching, matroids, and extensions
- Finding maximum square-free 2-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- A Faster Algorithm for the Maximum Even Factor Problem
- A Combinatorial Algorithm to Find a Maximum Even Factor
- The Independent Even Factor Problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Improved algorithms for even factors and square-free simple \(b\)-matchings
