König Deletion Sets and Vertex Covers above the Matching Size

DOI10.1007/978-3-540-92182-0_73zbMath1183.68313OpenAlexW1608842506MaRDI QIDQ3597884

Somnath Sikdar, Venkatesh Raman, Sounaka Mishra, Saket Saurabh

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_73

Mathematics Subject Classification ID

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

Related Items (4)

Faster exact algorithms for some terminal set problems ⋮ On approximability of optimization problems related to red/blue-split graphs ⋮ On the parameterized vertex cover problem for graphs with perfect matching ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition

This page was built for publication: König Deletion Sets and Vertex Covers above the Matching Size