A fast scaling algorithm for the weighted triangle-free 2-matching problem
DOI10.1016/J.EJC.2017.07.008zbMATH Open1373.05146OpenAlexW2756272112MaRDI QIDQ1678085FDOQ1678085
Authors: Peng Zhang 
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.008
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A data structure for dynamic trees
- Faster scaling algorithms for general graph matching problems
- Faster Scaling Algorithms for Network Problems
- Maximum matching and a polyhedron with 0,1-vertices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Title not available (Why is that?)
- Clique partitions, graph compression and speeding-up algorithms
- A matching problem with side conditions
- Triangle-free 2-matchings and M-concave functions on jump systems
- Maximum skew-symmetric flows and matchings
- Perfect triangle-free 2-matchings
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Triangle-free 2-matchings revisited
Cited In (6)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- Triangle-free 2-matchings revisited
- Title not available (Why is that?)
- Triangle-free 2-matchings revisited
This page was built for publication: A fast scaling algorithm for the weighted triangle-free 2-matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678085)
