Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications
作者： P. Spirakis , G. Miller , D. Kornhauser
DOI:
关键词:
摘要: We have obtaincd some results in pebble coordination problems and the diameter of permutation groups.
amazon.com
computer.org
acm.org 参考文章(6)
Jacob T Schwartz, Micha Sharir, On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds Advances in Applied Mathematics. ,vol. 4, pp. 298- 351 ,(1983) , 10.1016/0196-8858(83)90014-3
John H. Reif, Complexity of the mover's problem and generalizations 20th Annual Symposium on Foundations of Computer Science (sfcs 1979). pp. 421- 427 ,(1979) , 10.1109/SFCS.1979.10
Mark Jerrum, A compact representation for permutation groups 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 126- 133 ,(1982) , 10.1109/SFCS.1982.52
Richard M Wilson, Graph puzzles, homotopy, and the alternating group☆ Journal of Combinatorial Theory, Series B. ,vol. 16, pp. 86- 96 ,(1974) , 10.1016/0095-8956(74)90098-7
James R. Driscoll, Merrick L. Furst, On the diameter of permutation groups symposium on the theory of computing. pp. 152- 160 ,(1983) , 10.1145/800061.808744
Merrick Furst, John Hopcroft, Eugene Luks, Polynomial-time algorithms for permutation groups 21st Annual Symposium on Foundations of Computer Science (sfcs 1980). pp. 36- 41 ,(1980) , 10.1109/SFCS.1980.34