Discrete Applied Mathematics 1998: Vol 83 Table of Contents

3 Pages·1998·0.37 MB·English

DISCRETE APPLIED MATHEMATICS
Volume 83, Numbers 1-3, 25 March 1998
Network Communications. Broadcasting and Gossiping
Abstracted/Indexed in: ACM Computing Reviews, Cambridge Scientific
Abstracts, Current Contents: Physical, Chemical & Earth Sciences, Engineering
Index/Compendex, INSPEC Information Services, International Abstracts in
Operations Research, Mathematical Reviews, PASCAL, Science Citation Index,
Statistical Theory and Method Abstracts, Zentralblatt fiir Mathematik.
Contents
Contributions
Preface 1
F. Bao, Y. Igarashi and S.R. Ohring
Reliable broadcasting in product networks 3
S. Bezrukov, B. Monien, W. Unger and G. Wechsung
Embedding ladders and caterpillars into the hypercube 21
F. Comellas and M. Mitjana
Broadcasting in cycle prefix digraphs 31
K.-S. Ding, C.-T. Ho and J.-J. Tsay
Matrix transpose on meshes with wormhole and XY routing 41
A.M. Farley, A. Pelc and A. Proskurowski
Minimum-time multidrop broadcast 61
P. Fragopoulou and S.G. Akl
Spanning subgraphs with applications to communication on a
subclass of the Cayley-graph-based networks 79
L. Gargano, A.A. Rescigno and U. Vaccaro
Minimum time broadcast in faulty star networks 97
L. Gasieniec and A. Pelc
Broadcasting with linearly bounded transmission faults 121
A. Germa, M.-C. Heydemann and D. Sotteau
Cycles in the cube-connected cycles graph 135
O. Gerstel, A. Wool and S. Zaks |
Optimal layouts on a chain ATM network 157
A. Jakoby, R. Reischuk and C. Schindelhauer
The complexity of broadcasting in planar and decomposable graphs
J.O. Kane and J.G. Peters
Line broadcasting in cycles
R. Klasing
The relationship between the gossip complexity in vertex-disjoint
paths mode and the vertex bisection width 229
S. Perennes
Broadcasting and gossiping on de Bruijn, shuffle-exchange and
similar networks 247
A. Shastri
Time-relaxed broadcating in communication networks 263
P. Tvrdik, R. Harbane and M.-C. Heydemann
Uniform homomorphisms of de Bruijn and Kautz networks 279
E.A. Varvarigos
Optimal communication algorithms for Manhattan Street networks 303
Author Index 327
:
ae
&

e
e
e

er
A
t

.
et
Fo
e
e

~~
e
e
e

er
-
* =
epee
M
i
s
,

‘
pm
,
a
l

ac
anes
4
’
.
met
:
:
P
?
e
e
e

e
e

we
a
y

a
e

&