Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

DOI10.1007/978-3-642-10631-6_88zbMath1272.05198OpenAlexW1584621367MaRDI QIDQ3652274

Robert Franke, Dorothea Wagner, Ignaz Rutter

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000012970/1106185

zbMATH Keywords

algorithmscomputing large matchingscomputing maximum matchingsfixed minimum degree

Mathematics Subject Classification ID

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

This page was built for publication: Computing Large Matchings in Planar Graphs with Fixed Minimum Degree