Fault-tolerant routing in burnt pancake graphs
From MaRDI portal
Publication:765472
DOI10.1016/J.IPL.2010.04.023zbMATH Open1234.68325OpenAlexW2023048456MaRDI QIDQ765472FDOQ765472
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- A group-theoretic model for symmetric interconnection networks
- Node-to-node cluster fault tolerant routing in star graphs
- Bounds for sorting by prefix reversal
- Title not available (Why is that?)
- On the problem of sorting burnt pancakes
- Fault tolerant routing in the star and pancake interconnection networks
Cited In (12)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Cyclic Vertex (Edge) Connectivity of 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
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- The structure fault tolerance of burnt pancake networks
- Relationship between extra edge connectivity and component edge connectivity for regular graphs
- The (conditional) matching preclusion for burnt pancake graphs
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
- Target set selection on generalized pancake graphs
- Neighbor connectivity of pancake graphs and burnt pancake graphs
This page was built for publication: Fault-tolerant routing in burnt pancake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765472)
