Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1995: Algorithms and Data Structures pp 263–269Cite as

A ranking algorithm for Hamilton paths in shuffle-exchange graphs

  • Invited Presentation
  • Conference paper
  • First Online:

  • 167 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

Abstract

In previous work, Feldmann and Mysliwietz [3] showed that every shuffle-exchange graph contains a Hamilton path. In this paper, we show that there is a linear time ranking algorithm associated with that Hamilton path. The ranking algorithm returns the rank-position of each node of the graph with respect to the order given by the Hamilton path. Ranking algorithms are important for they can be applied to yield efficient implementations of certain network emulations using SIMD-style parallel algorithms for translating node labels.

This research has been supported in part by NSF Grant CCR-93-09470.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.S. Annexstein (1994): Ranking algorithms for hamiltonian paths in hypercubic networks, to appeal in AMS DIMACS series, Proceedings of the DIMACS Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations.

    Google Scholar 

  2. F.S. Annexstein (1993): Parallel implementations of graph embeddings, in Parallel Architectures and Their Efficient Use, Lecture Notes in Computer Science 678, Springer Verlag, 207–217.

    Google Scholar 

  3. R. Feldmann and P. Mysliwietz (1992): The shuffle exchange network has a Hamiltonian path, Proceedings of 17th Mathematical Foundations of Computer Science (MFCS '92), Lecture Notes in Computer Science 629, Springer Verlag, 246–254.

    Google Scholar 

  4. R. Feldmann and W. Unger (1992): The cube-connected cycles network is a subgraph of the butterfly network. Parallel Processing Letters (2), 1, 13–19.

    Article  Google Scholar 

  5. D.M. Gordon (1991): Parallel sorting on Cayley graphs. Algorithmica (6), 554–564.

    Article  Google Scholar 

  6. F. Gray (1953): Pulse code communication, U.S. Patent Number 2,632,058.

    Google Scholar 

  7. H.S. Wilf (1989): Combinatorial algorithms: an update, CBMS-55, SIAM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of ECECS, University of Cincinnati, 45221-0008, Cincinnati, OH, USA

    Fred S. Annexstein & Eugene A. Kuchko

Authors
  1. Fred S. Annexstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugene A. Kuchko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Annexstein, F.S., Kuchko, E.A. (1995). A ranking algorithm for Hamilton paths in shuffle-exchange graphs. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation