Some simplified NP-complete graph problems
- 29 February 1976
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 1 (3), 237-267
- https://doi.org/10.1016/0304-3975(76)90059-1
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Matching: A Well-Solved Class of Integer Linear ProgramsPublished by Springer Science and Business Media LLC ,2003
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Complete register allocation problemsPublished by Association for Computing Machinery (ACM) ,1973
- Polynomial complete scheduling problemsACM SIGOPS Operating Systems Review, 1973
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941