Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

DOI10.1007/978-3-319-04657-0_27zbMath1408.68076OpenAlexW110017694MaRDI QIDQ5746265

Jiong Guo, Yash Raj Shrestha

Publication date: 18 February 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_27

Mathematics Subject Classification ID

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)

This page was built for publication: Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs