Title of article
Congestion-Free, Dilation-2 Embedding of Complete Binary Trees into Star Graphs
Author/Authors
Chen، Yuh-Shyan نويسنده , , Juang، Tong-Ying نويسنده , , Tseng، Yu-Chee نويسنده , , Chang، Chiou-Jyu نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-220
From page
221
To page
0
Abstract
We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of computing the deterministic solution maximizing it. © 1999 John Wiley & Sons, Inc. Networks 33: 207-219, 1999
Keywords
graph embedding , Interconnection network , complete binary tree , star graph , Parallel processing
Journal title
NETWORKS
Serial Year
1999
Journal title
NETWORKS
Record number
13449
Link To Document