Matching for Graphs of Bounded Degree

DOI10.1007/978-3-540-69311-6_19zbMath1143.05324OpenAlexW199203743MaRDI QIDQ3507330

Yijie Han

Publication date: 19 June 2008

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_19

zbMATH Keywords

Matchinglower bound

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Tight bound for matching ⋮ Computing large matchings in planar graphs with fixed minimum degree ⋮ The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs

Cites Work

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Tight bounds on maximal and maximum matchings
• The Factorization of Linear Graphs

This page was built for publication: Matching for Graphs of Bounded Degree