Cycles in butterfly graphs
- 3 February 2000
- Vol. 35 (2) , 161-171
- https://doi.org/10.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-q
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Hamilton Cycle Decomposition of the Butterfly NetworkParallel Processing Letters, 1998
- Hamilton circuits in the directed wrapped Butterfly networkDiscrete Applied Mathematics, 1998
- Optimal emulations by butterfly-like networksJournal of the ACM, 1996
- Efficient Gossiping by Packets in Networks with Random FaultsSIAM Journal on Discrete Mathematics, 1996
- On the Construction of Fault-Tolerant Cube-Connected Cycles NetworksJournal of Parallel and Distributed Computing, 1995
- Two edge-disjoint hamiltonian cycles in the butterfly graphInformation Processing Letters, 1994
- Embedding of cycles in arrangement graphsIEEE Transactions on Computers, 1993
- Group Action Graphs and Parallel ArchitecturesSIAM Journal on Computing, 1990
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984