Author:
Arbib Claudio,Flammini Michele,Nardelli Enrico
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. B. Bollobás, Random Graphs, Academic Press, London, 1985.
2. E.C. Freuder, A Sufficient Condition for Backtrack-bounded Search, J. ACM 29 (1982) 24–32.
3. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman, San Francisco, CA, 1979.
4. F. Harary, Graph Theory, Addison-Wesely, New York, 1969.
5. The NP-completeness Column: an Ongoing Guide;Johnson;J. Algorithms,1987
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献