Skip to Main content Skip to Navigation
Conference papers

Embedding Algorithms for Bubble-Sort, Macro-Star, and Transposition Graphs

Abstract : Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and shows that a bubble-sort graph Bn can be embedded in a transposition graph Tn with dilation 1 and expansion 1. In contrast, a macro-star graph MS(2, n) can be embedded in a transposition graph with dilation n, but with an average dilation of 2 or under.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01054983
Contributor : Hal Ifip <>
Submitted on : Monday, August 11, 2014 - 9:05:30 AM
Last modification on : Friday, August 11, 2017 - 5:43:54 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 9:40:26 PM

File

NPC10-1569315047-manucript.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Hyeongok Lee, Dongwan Kim, Junghyun Seo, Mihye Kim. Embedding Algorithms for Bubble-Sort, Macro-Star, and Transposition Graphs. IFIP International Conference on Network and Parallel Computing (NPC), Sep 2010, Zhengzhou, China. pp.134-143, ⟨10.1007/978-3-642-15672-4_12⟩. ⟨hal-01054983⟩

Share

Metrics

Record views

154

Files downloads

289