Computing large matchings fast
DOI10.1145/1868237.1868238zbMATH Open1295.05238OpenAlexW2620994567MaRDI QIDQ3188982FDOQ3188982
Authors: Ignaz Rutter, Alexander Wolff 
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000007350
Recommendations
- Computing large matchings in planar graphs with fixed minimum degree
- Computing large matchings in planar graphs with fixed minimum degree
- Maximum matching in regular and almost regular graphs
- Finding maximum matchings in random regular graphs in linear expected time
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs
maximum matchings3-connected planar graphs3-regular graphslarge matchingsbounded-degree block treesmaxdeg-3 graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (11)
- Fast profile matching algorithms - A survey
- Solving (large scale) matching problems combinatorially
- Solving large-scale matching problems efficiently: A new primal matching approach
- Computing large matchings in planar graphs with fixed minimum degree
- Edge guards for polyhedra in three-space
- Linear reductions of maximum matching
- Maximum matching in regular and almost regular graphs
- Computing large matchings in planar graphs with fixed minimum degree
- Title not available (Why is that?)
- On adaptive algorithms for maximum matching
- Lazy or eager dynamic matching may not be fast
This page was built for publication: Computing large matchings fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188982)
