Node-Deletion NP-Complete Problems

@article{Krishnamoorthy1979NodeDeletionNP,
  title={Node-Deletion NP-Complete Problems},
  author={M. S. Krishnamoorthy and N. Deo},
  journal={SIAM J. Comput.},
  year={1979},
  volume={8},
  pages={619-625}
}
  • M. S. Krishnamoorthy, N. Deo
  • Published 1979
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • The entire class of node-deletion problems can be stated as follows: Given a graph G, find the minimum number of nodes to be deleted so that the remaining subgraph g satisfies a specified property $\pi $. For each $\pi $, a distinct node-deletion problem arises. The various deletion problems considered here are for the following properties: each component of g is (i) null, (ii) complete, (iii) a tree, (iv) nonseparable, (v) planar, (vi) acyclic, (vii) bipartite, (viii) transitive, (ix… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Node-and edge-deletion NP-complete problems
    402
    Parallel Algorithms for Maximal Acyclic Sets
    • Z. Chen, Xin He
    • Mathematics, Computer Science
    • 1997
    2
    Parallel algorithms for maximal acyclic sets
    4
    Parameterized Complexity of Fair Deletion Problems
    8
    The max quasi-independent set Problem
    7
    Edge-deletion and edge-contraction problems
    34
    Acyclic Matchings in Subclasses of bipartite Graphs
    5