Fault-tolerant routing in burnt pancake graphs
From MaRDI portal
(Redirected from Publication:765472)
Cites work
- scientific article; zbMATH DE number 1471732 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Bounds for sorting by prefix reversal
- Fault tolerant routing in the star and pancake interconnection networks
- Node-to-node cluster fault tolerant routing in star graphs
- On the problem of sorting burnt pancakes
Cited in
(12)- Neighbor connectivity of pancake graphs and burnt pancake graphs
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake 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
- Target set selection on generalized pancake graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- Analysis on component connectivity of bubble-sort star graphs and 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
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
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)