Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, p. 221. Freeman, San Francisco (1979)
2. Johnson, D.S.: The NP-Completeness Column: An Ongoing Guide. J. of Algorithms 4, 397–411 (1983)
3. Kornhauser, D.M., Miller, G., Spirakis, P.: Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications. In: Proc. of the 25th FOCS, pp. 241–250 (1984)
4. Wilson, R.W.: Graphs, Puzzles, Homotopy, and Alternating Groups. J. of Comb. Th. (B) 16, 86–96 (1974)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献