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.
Keywords
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.
This research has been supported in part by NSF Grant CCR-93-09470.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
D.M. Gordon (1991): Parallel sorting on Cayley graphs. Algorithmica (6), 554–564.
F. Gray (1953): Pulse code communication, U.S. Patent Number 2,632,058.
H.S. Wilf (1989): Combinatorial algorithms: an update, CBMS-55, SIAM.
Author information
Authors and Affiliations
Editor information
Rights 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