Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
- 28 September 2008
- journal article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 49 (3) , 354-372
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Conditional fault-tolerant hamiltonicity of star graphsParallel Computing, 2007
- Embedding longest fault-free paths onto star graphs with more vertex faultsTheoretical Computer Science, 2005
- Longest fault-free paths in star graphs with edge faultsIEEE Transactions on Computers, 2001
- Longest fault-free paths in star graphs with vertex faultsTheoretical Computer Science, 2001
- Hamiltonian-laceability of star graphsNetworks, 2000
- Optimal Communication Algorithms on Star Graphs Using Spanning Tree ConstructionsJournal of Parallel and Distributed Computing, 1995
- A comparative study of topological properties of hypercubes and star graphsIEEE Transactions on Parallel and Distributed Systems, 1994
- A routing and broadcasting scheme on faulty star graphsIEEE Transactions on Computers, 1993
- 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