A probabilistic estimator for the vertex deletion problem

DOI10.1016/S0898-1221(98)00012-1zbMath0903.68142OpenAlexW2035314709MaRDI QIDQ1130419

C. A. Mandal, Sujoy Ghose, Partha Pratim Chakrabarti

Publication date: 20 August 1998

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00012-1

zbMATH Keywords

vertex deletion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cites Work

• The node-deletion problem for hereditary properties is NP-complete
• Node-Deletion Problems on Bipartite Graphs
• Node-and edge-deletion NP-complete problems

This page was built for publication: A probabilistic estimator for the vertex deletion problem