Fault-tolerant routing in burnt pancake graphs

DOI10.1016/j.ipl.2010.04.023zbMath1234.68325OpenAlexW2023048456MaRDI QIDQ765472

Tatsuya Iwasaki, Keiichi Kaneko

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.023

zbMATH Keywords

fault toleranceinterconnection networksparallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs ⋮ Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs ⋮ Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs ⋮ Paired 2-disjoint path covers of burnt pancake graphs with faulty elements ⋮ Target set selection on generalized pancake graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults ⋮ The extra connectivity and extra diagnosability of regular interconnection networks ⋮ Relationship between extra edge connectivity and component edge connectivity for regular graphs ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs ⋮ Fault tolerance and diagnosability of burnt pancake networks under the comparison model

Cites Work

• Unnamed Item
• Bounds for sorting by prefix reversal
• Node-to-node cluster fault tolerant routing in star graphs
• On the problem of sorting burnt pancakes
• Fault tolerant routing in the star and pancake interconnection networks
• A group-theoretic model for symmetric interconnection networks