Fault-tolerant routing in burnt pancake graphs
Authors:
- Tatsuya IwasakiTITatsuya Iwasaki
- Keiichi KanekoKKKeiichi Kaneko
- 1 July 2010
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 110 (14-15) , 535-538
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Spanning Connectivity of the Burnt Pancake GraphsIEICE Transactions on Information and Systems, 2009
- Shortest path routing and fault-tolerant routing on de Bruijn networksNetworks, 2000
- Node-to-node cluster fault tolerant routing in star graphsInformation Processing Letters, 1995
- On the problem of sorting burnt pancakesDiscrete Applied Mathematics, 1995
- Fault tolerant routing in the star and pancake interconnection networksInformation Processing Letters, 1993
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979