Constructing edge-disjoint spanning trees in twisted cubes
Author:
- Ming-Chien YangMYMing-Chien Yang
- 1 October 2010
- journal article
- Published by Elsevier in Information Sciences
- Vol. 180 (20) , 4075-4083
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faultsTheoretical Computer Science, 2008
- Embedding of Cycles in Twisted Cubes with Edge-PancyclicAlgorithmica, 2007
- Optimal fault-tolerant embedding of paths in twisted cubesJournal of Parallel and Distributed Computing, 2007
- Finding Four Independent TreesSIAM Journal on Computing, 2006
- Congestion-free embedding of 2(n−k) spanning trees in an arrangement graphJournal of Systems Architecture, 2001
- Topological properties of twisted cubeInformation Sciences, 1999
- Edge-disjoint spanning trees on the star network with applications to fault toleranceIEEE Transactions on Computers, 1996
- Arrangement graphs: a class of generalized star graphsInformation Processing Letters, 1992
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphsJournal of Algorithms, 1988
- The twisted cube1987