On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
From MaRDI portal
Publication:1582646
Recommendations
Cites work
- A group-theoretic model for symmetric interconnection networks
- Embedding complete binary trees into hypercubes
- Fault diameter of interconnection networks
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
- Near embeddings of hypercubes into Cayley graphs on the symmetric group
- On Group Graphs and Their Fault Tolerance
- On the embedding of cycles in pancake graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
Cited in
(8)- The super connectivity of the pancake graphs and the super laceability of the star graphs
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Cluster fault-tolerant routing in pancake graphs
- Ring embedding in faulty pancake graphs
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- Embedding meshes into twisted-cubes
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- Neighbor connectivity of pancake graphs and burnt pancake graphs
This page was built for publication: On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582646)
