Complexity of disjoint -vertex deletion for disconnected forbidden subgraphs

DOI10.7155/JGAA.00339MaRDI QIDQ2938754zbMATH OpenOpenAlexFDO

Authors Jiong Guo, Yash Raj Shrestha

Publication date 15 January 2015

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00339

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of disjoint -vertex deletion for disconnected forbidden subgraphs
• A complexity dichotomy for finding disjoint solutions of vertex deletion problems
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
• Tight running time lower bounds for vertex deletion problems
• scientific article; zbMATH DE number 4089594

Cited in

(4)

• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs
• Complexity of disjoint -vertex deletion for disconnected forbidden subgraphs
• A complexity dichotomy for finding disjoint solutions of vertex deletion problems
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

This page was built for publication: Complexity of disjoint \({\Pi}\)-vertex deletion for disconnected forbidden subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938754)