Title of article :
Transmissions in a Network with Capacities and Delays
Author/Authors :
Kagaris، Dimitrios نويسنده , , Pantziou، Grammati E. نويسنده , , Tragoudas، Spyros نويسنده , , Zaroliagis، Christos D. نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Abstract :
Let G be a connected graph with n vertices. Let (alpha) be a permutation in Sn. The (alpha)-generalized graph over G, denoted by P(alpha)(G), consists of two disjoint, identical copies of G along with edges v(alpha)(v). In this paper, we investigated the relation between diameter of P(alpha)(G) and diameter of G for any permutation (alpha) E Sn. ©1999 John Wiley & Sons, Inc. Networks 33: 161-166, 1999
Keywords :
sparse network , transmission time , dynamic algorithm , data transmission , quickest path
