Node-and edge-deletion NP-complete problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1978, Pages 253-264

  Yannakakis, Mihalis ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Approximation; Computational complexity; Edge deletion; Graph; Graphproperty; Hereditary; Maximum subgraph; Node deletion; NP complete; Polynomial hierarchy

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

APPROXIMATION; EDGE-DELETION; GRAPH; GRAPHPROPERTY; HEREDITARY; NODE DELETION; NP COMPLETE; POLYNOMIAL HIERARCHIES; SUBGRAPHS;

GRAPH THEORY;

EID: 84871918452     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800133.804355     Document Type: Conference Paper

References (21)

1. G. Ausiello, A. D'Atri, and M. Protasi, "On the structure of combinatorial problems and structure preserving reductions", Proc. of Fourth Coll. on Automata, Languages, and Programming, Lecture Notes in Computer Science 52, Springer-Verlag (1977) 45-57.
2. C. Berge, Graphs and Hupergraphs, North-Holland, Amsterdam, 1973.
3. S.A. Cook, "The Complexity of theorem-proving procedures", Proc. of Third Annual ACM Symp. on Theory of Computing (1971, 151-158.
4. S. Even, "Maximal flow in a network and the connectivity of a graph," Proc. of Eighth Annual Princeton Conf. on Info. Sci. and Systems (1974), 470-472.
5. J. Edmonds, "Paths. Trees and Flowers", Can. J. Math. 17 (1965), 449-467.
6. M. R. Garey, and D. S. Johnson, Comouters and Intractability: A Guide to the Theory of NP-completeness, H. Freeman & Sons, San Francisco, 1978.
7. M. R. Garey, D. S. Johnson, and L Stockmeyer, "Some simplified NP-complete graph problems", Theoretical Comp. Science 1 (1976), 237-267.
8. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1970.
9. D. J. Johnson, "Approximation algorithms for combinatorial problems", J. Comp. System Sci. 9 (1974), 256-278.
10. R. M. Karp, "Reductibility among combinatorial problems", in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, NY, 1972, 85-103.
11. M. S. Kirshnamoorthy and N. Deo, "Node-deletion NP-complete problems", Computer Science Program, Indian Institute of Technology, report, (1977).
12. E.W. Legged Jr., "Tools and techniques for classifying problems", Ph. D. Thesis, Dept. of Comp, and info. Sciences, Ohio State Univ. (1977).
13. J. M. Lewis, "On the complexity of the maximum subgraph problem", these Proceedings.
14. J. M. Lewis, D. P. Dobkin, and R. J. Lipton, "Graph properties defined by a forbidden subgraph", Proc. of the 1977 Conference on Info. Sci. and Systems, 108-112.
15. D. Plaisted, "Some polynomial and integer divisibility problems are NP-hard", 17th Annual IEEE Symp. on Foundations of Computer Science (1976), 264-267.
16. D. Plaisted, "New NP-hard and NP-complete polynomial and integer divisibility problems", 18th Annual IEEE Symp. on Foundations of Computer Science (1977), 241-253.
17. L. Stockmeyer, "The polynomial time hierarchy", Theoretical Comp. Sci. 3 (1977), 1-22.
18. R. E. Tarjan, "Testing Graph connectivity", Proc. of the Sixth Annual ACM Symp. on Theory of Computing, (1974), 185-193.
19. R. E. Tarjan, "Depth-first-search and linear graph algorithms", SIAM J. on Computing 1 (1972), 146-160.
20. M. Yannakakis, "Node-deletion problems on bipartite graphs", Technical report, Computer Science Lab.,
21. M. Yannakakis, "The effect of a connectivity requirement on the complexity of maximum subgraph problems", Technical report, Computer Science Lab., Princeton University, 1978.