Star, bubble-sort, pancake, and Rotator-Faber-Moore (RFM) graphs are well-known interconnection networks that have node symmetric, maximum fault tolerance and hierarchical partition properties. These graphs are widely assumed to improve the network cost of a hypercube. This study proposes embedding methods for a star graph and its variations, and provides an analysis of the relevant costs. Results show that a bubble-sort graph can be embedded in a star graph with dilation 3, and in a RFM graph with dilation 2, while a star graph can be embedded in a pancake graph with dilation 4. The results suggest that the embedding method developed for the bubble-sort graph can be simulated in star graphs and RFM graphs in constant time O(1). © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Kim, M., Kim, D., & Lee, H. (2010). Embedding algorithms for star, bubble-sort, rotator-faber-moore, and pancake graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6082 LNCS, pp. 348–357). https://doi.org/10.1007/978-3-642-13136-3_36
Mendeley helps you to discover research relevant for your work.