A fast scaling algorithm for the weighted triangle-free 2-matching problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1263228 (Why is no real title available?)
- A data structure for dynamic trees
- A fast scaling algorithm for the weighted triangle-free 2-matching problem
- A matching problem with side conditions
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Clique partitions, graph compression and speeding-up algorithms
- Faster Scaling Algorithms for Network Problems
- Faster scaling algorithms for general graph matching problems
- Maximum matching and a polyhedron with 0,1-vertices
- Maximum skew-symmetric flows and matchings
- Perfect triangle-free 2-matchings
- Triangle-free 2-matchings and M-concave functions on jump systems
- 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
- scientific article; zbMATH DE number 4062620 (Why is no real title available?)
- 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)