On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
From MaRDI portal
Publication:1582646
DOI10.1016/S0020-0255(00)00021-9zbMATH Open0965.68074OpenAlexW1965423440MaRDI QIDQ1582646FDOQ1582646
Authors: Wei-Chen Fang, Chiun-Chieh Hsu 
Publication date: 15 October 2000
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(00)00021-9
Recommendations
Cites Work
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A group-theoretic model for symmetric interconnection networks
- On the embedding of cycles in pancake graphs
- On Group Graphs and Their Fault Tolerance
- Fault diameter of interconnection networks
- Near embeddings of hypercubes into Cayley graphs on the symmetric group
- Embedding complete binary trees into hypercubes
- Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
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)
