Some Simplified NP-Complete Graph Problems

[1]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[2]  P. Herrmann.  ON REDUCIBILITY AMONG COMBINATORIAL PROBLEMS , 1973 .

[3]  Larry Stockmeyer,et al.  Planar 3-colorability is polynomial complete , 1973, SIGA.

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[5]  Ravi Sethi,et al.  Complete register allocation problems , 1973, SIAM J. Comput..

[6]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[7]  Sartaj Kumar Sahni,et al.  On The Knapsack And Other Computationally Related Problems , 1973 .

[8]  Jeffrey D. Ullman,et al.  Polynomial complete scheduling problems , 1973, SOSP '73.

[9]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[10]  Sartaj Sahni.  Some Related Problems from Network Flows, Game Theory and Integer Programming , 1972, SWAT.

[11]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[12]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[13]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[14]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[15]  Ronald L. Graham,et al.  Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).

[16]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[17]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .