Advertisement

Applications of Cayley graphs

  • G. Cooperman
  • L. Finkelstein
  • N. Sarawagi
Submitted Contributions Algorithms And Designs For Symbolic And Algebraic Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)

Abstract

This paper demonstrates the power of the Cayley graph approach to solve specific applications, such as rearrangement problems and the design of interconnection networks for parallel CPU's. Recent results of the authors for efficient use of Cayley graphs are used here in exploratory analysis to extend recent results of Babai et al. on a family of trivalent Cayley graphs associated with PSL2(p). This family and its subgroups are important as a model for interconnection networks of parallel CPU's. The methods have also been used to solve for the first time problems which were previously too large, such as the diameter of Rubik's 2 × 2 × 2 cube. New results on how to generalize the methods to rearrangement problems without a natural group structure are also presented.

Keywords

Permutation Group Cayley Graph Interconnection Network Legal Move Function Count 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Annexstein, M. Baumslag, A.L. Rosenberg, “Group Action Graphs and Parallel Architectures”, COINS Technical Report 87–133, Computer and Information Science Department, University of Massachusetts (1987).Google Scholar
  2. 2.
    L. Babai, W.M. Kantor and A. Lubotsky, “Small diameter Cayley graphs for finite simple groups”, European Journal of Combinatorics 10 (1989), pp. 507–522.Google Scholar
  3. 3.
    J-C. Bermond, C. Delome, and J-J. Quisquater, “Strategies for interconnection networks: Some methods from graph theory”, Journal of Parallel and Distributed Computing 3 (1986), pp. 433–449.Google Scholar
  4. 4.
    C.A. Brown, G. Cooperman, and L. Finkelstein, “Solving Permutation Problems Using Rewriting Rules”, Symbolic and Algebraic Computation (Proc. of International Symposium ISSAC '88, Rome, 1988), Springer Verlag Lecture Notes in Computer Science 358, 364–377.Google Scholar
  5. 5.
    L. Campbell, G.E. Carlsson, V. Faber, M.R. Fellows, M.A. Langston, J.W. Moore, A.P. Mullhaupt, and H.B. Sexton, “Dense Symmetric Networks from Linear Groups”, preprint.Google Scholar
  6. 6.
    J.J. Cannon, “Construction of Defining Relators for Finite Groups”, Discrete Math. 5 (1973), pp. 105–129.Google Scholar
  7. 7.
    G.E. Carlson, J.E. Cruthirds, H.B. Sexton, and C.G. Wright, “Interconnection networks based on a generalization of cube-connected cycles”, I.E.E.E. Trans. Comp. C-34 (1985), pp. 769–777.Google Scholar
  8. 8.
    D.V Chudnovsky, G.V. Chudnovsky and M.M. Denneau, “Regular Graphs with Small Diameter as Models for Interconnection Networks”, 3rd Int. Conf. on Supercomputing, Boston, May, 1988, pp. 232–239.Google Scholar
  9. 9.
    G. Cooperman and L. Finkelstein, “New Methods for Using Cayley Graphs in Interconnection Networks”, to appear in Discrete Applied Mathematics, Special Issue on Interconnection Networks, (also Northeastern University Technical Report NU-CCS-89-26).Google Scholar
  10. 10.
    M. Frydenberg, A. Riel, N. Sarawagi, Unpublished manuscript.Google Scholar
  11. 11.
    D. Kornhauser, G. Miller and P. Spirakis, “Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups and Applications”, Proc. 25 th IEEE FOCS (1984), pp. 241–250.Google Scholar
  12. 12.
    T. Ohtsuki, “Maze-Running and Line-Search Algorithms”, article in Advances in CAD for VLSI, 4, North Holland, Amsterdam (1986).Google Scholar
  13. 13.
    C.C. Sims, “Computation with Permutation Groups”, in Proc. Second Symposium on Symbolic and Algebraic Manipulation, edited by S.R. Petrick, ACM, New York, 1971.Google Scholar
  14. 14.
    D. Singmaster, Notes on Rubik's Magic Cube, Enslow Publishers, Hillside, N.J., 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • G. Cooperman
    • 1
  • L. Finkelstein
    • 1
  • N. Sarawagi
    • 1
  1. 1.College of Computer ScienceNortheastern UniversityBostonU.S.A.

Personalised recommendations