Congestion-free embedding of 2(n−k) spanning trees in an arrangement graph
Authors:
- Yuh-Shyan ChenYuh-Shyan Chen
- Ying-Ying ShenYSYing-Ying Shen
- 1 January 2001
- journal article
- Published by Elsevier in Journal of Systems Architecture
- Vol. 47 (1) , 73-86
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Congestion-free, dilation-2 embedding of complete binary trees into star graphsNetworks, 1999
- Fault-free Hamiltonian cycles in faulty arrangement graphsIEEE Transactions on Parallel and Distributed Systems, 1999
- Fault-Tolerant Broadcasting on the Arrangement GraphThe Computer Journal, 1998
- Toward optimal broadcast in a star graph using multiple spanning treesIEEE Transactions on Computers, 1997
- Fault-tolerant ring embedding in a star graph with both link and node failuresIEEE Transactions on Parallel and Distributed Systems, 1997
- An optimal broadcasting algorithm without message redundancy in star graphsIEEE Transactions on Parallel and Distributed Systems, 1995
- Embedding Grids, Hypercubes, and Trees in Arrangement Graphs1993
- Embedding of cycles in arrangement graphsIEEE Transactions on Computers, 1993
- Arrangement graphs: a class of generalized star graphsInformation Processing Letters, 1992