Author:
Clark Brent N.,Colbourn Charles J.,Johnson David S.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Unit disk graphs;Clark,1985
2. Theoretical improvements in algorithmic efficiency for network flow problems;Edmonds;J. ACM,1972
3. Some simplified NP-complete graph problems;Garey;Theoret. Comput. Sci.,1976
4. The rectilinear Steiner tree problem is NP-complete;Garey;SIAM J. Appl. Math.,1977
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
Cited by
837 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献