Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference8 articles.
1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. The planar Hamiltonian circuit problem is NP-complete;Garey;SIAM J. Comput.,1976
3. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph;Gavril;SIAM J. Comput.,1972
4. Graph Theory;Harary,1969
5. Reducibility among combinatorial problems;Karp,1972
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献