Computing large matchings fast

DOI10.1145/1868237.1868238zbMath1295.05238OpenAlexW2620994567MaRDI QIDQ3188982

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

zbMATH Keywords

maximum matchings3-connected planar graphs3-regular graphslarge matchingsbounded-degree block treesmaxdeg-3 graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Edge guards for polyhedra in three-space ⋮ Computing large matchings in planar graphs with fixed minimum degree