TRIANGLE-FREE 2-MATCHINGS REVISITED
From MaRDI portal
Publication:3084696
DOI10.1142/S1793830910000930zbMath1216.05109MaRDI QIDQ3084696
Alexey Gusakov, Ilya Razenshteyn, Maxim A. Babenko
Publication date: 25 March 2011
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Faster algorithms for half-integral T -Path packing, A fast scaling algorithm for the weighted triangle-free 2-matching problem, Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Cites Work
- Unnamed Item
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Perfect triangle-free 2-matchings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs