Knocking Out P k -free Graphs
From MaRDI portal
Publication:2922626
DOI10.1007/978-3-662-44465-8_34zbMath1426.68125OpenAlexW2595331024MaRDI QIDQ2922626
Daniël Paulusma, Anthony Stewart, Matthew Johnson
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_34
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
