Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
From MaRDI portal
Publication:4899244
DOI10.1007/978-3-642-33293-7_11zbMath1374.68241OpenAlexW2217678137WikidataQ60488516 ScholiaQ60488516MaRDI QIDQ4899244
Fedor V. Fomin, Michał Pilipczuk, Bart M. P. Jansen
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_11
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
This page was built for publication: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
