Author:
Bertossi Alan A.,Bonuccelli Maurizio A.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference18 articles.
1. Graphs and Hypergraphs;Berge,1973
2. The edge Hamiltonian path problem is NP-complete;Bertossi;Inform. Process. Lett.,1981
3. Finding Hamiltonian circuits in proper interval graphs;Bertossi;Inform. Process. Lett.,1983
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. The planar Hamiltonian circuit problem is NP-complete;Garey;SIAM J. Comput.,1976
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献