Some simplified np-comblete problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1974, Pages 47-63

  Garey, M R ^a   Johnson, D S ^a   Stockmeyer, L ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; HAMILTONIANS; UNDIRECTED GRAPHS;

3-COLORABILITY; EDGE WEIGHTS; GRAPH PROBLEMS; HAMILTONIAN CIRCUITS; MAX CUT; NODE COVER; NODE DEGREE; NP COMPLETE; PLANAR GRAPH; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 85028007389     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800119.803884     Document Type: Conference Paper

References (21)

1. D. Adolphson and T. C. Hu, "Optimal Linear Ordering," SIAM J. Applied Math. 25 (1973), 403-423.
2. R. L. Brooks, "On Coloring the Nodes of a Network," Proc. Cambridge Philos. Soc, 37 (1941), 194-197.
3. S. A. Cook, "The Complexity of Theorem-Proving Procedures," STOC (1971), 151-158.
4. J. Edmonds and E. L. Johnson, "Matching: A Well-Solved Class of Integer Linear Programs," Combinatorial Structures and Their Applications, Gordon and Breach (1970), 89-92.
5. S. Even, A. Lempel, and A. Pnueli, "Permutation Graphs and Transitive Graphs," JACM 19 (1972), 400-410.
6. M. R. Garey, R. L. Graham, J. D. Ullman, "Worst-Case Analysis of Memory Allocation Algorithms," STOC (1972), 143-150.
7. P. GApril, "Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent set of a Chordal Graph," SIAM J. Computing I (1972), 180187.
8. F. GApril, "Algorithms for a Maximum Clique and a Maximum Independent Set of a-Circle Graph," Networks 3 (1973), 261-273
9. R. L. Graham, "Bounds on Multiprocessing Anomalies and Related Packing Algorithms," SJCC (1972), 205-217.
10. P. Herrmann, Reducibllity among Combinatorial Problems, Masters Thesis, Massachusetts Institute of Technology (1973).
11. D. S. Johnson, "Fast Allocation Algorithms," SWAT (1972), 144-154.
12. D. S. Johnson, "Approximation Algorithms for Combinatorial Problems," STOC (1973), 38-49.
13. R. M. Karp, "Reducibllity Among Combinatorial Problems," Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds. Plenum Press, New York (1972), 85104.
14. B. W. Kernighan and S. Lin, "An Efficient Heuristic For Partitioning Graphs," BSTJ 49 (1970), 291308.
15. S. Lin and B. W. Kernighan, "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," BSTJ 21 (1973), 498-516.
16. G. I. Orlova and Y. G. Dorfman, "Finding the Maximum Cut in a Graph," Eng. Cybernetics 10 (1972), 502-506.
17. S. Sahni, "Some Related Problems From Network Flows, Game Theory, and Integer Programming," SWAT (1972), 130-138.
18. S. Sahni, On the Knapsack and Other Computationally Related Problems, Doctoral thesis, Cornell University (1973) .
19. R. Sethi, "Complete Register Allocation Problems," STOC (1973), I82-I95.
20. L. Stockmeyer, "Planar 3-Colorabil-ity is Polynomial Complete," SIGACT News 5, No. 3 (1973), 19-25.
21. J. D. Ullman, "Polynomial Complete Scheduling Problems," 4th Symp. on Operating System Principles (1973), 96-101.