Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=83
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reliable broadcasting in product networks
Feng Bao
,
Yoshihide Igarashi
,
Sabine R. Öhring
Discrete Applied Mathematics
83
(1-3), 1998, pp. 3-20
Embedding ladders and caterpillars into the hypercube
Sergei Bezrukov
,
Burkhard Monien
,
Walter Unger
,
Gerd Wechsung
Discrete Applied Mathematics
83
(1-3), 1998, pp. 21-29
Broadcasting in cycle prefix digraphs
F. Comellas
,
M. Mitjana
Discrete Applied Mathematics
83
(1-3), 1998, pp. 31-39
Matrix transpose on meshes with wormhole and
XY
routing
Kuo-Shun Ding
,
Ching-Tien Ho
,
Jyh-Jong Tsay
Discrete Applied Mathematics
83
(1-3), 1998, pp. 41-59
Minimum-time multidrop broadcast
Arthur M. Farley
,
Andrzej Pelc
,
Andrzej Proskurowski
Discrete Applied Mathematics
83
(1-3), 1998, pp. 61-77
Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks
Paraskevi Fragopoulou
,
Selim G. Akl
Discrete Applied Mathematics
83
(1-3), 1998, pp. 79-96
Minimum time broadcast in faulty star networks
Luisa Gargano
,
Adele A. Rescigno
,
Ugo Vaccaro
Discrete Applied Mathematics
83
(1-3), 1998, pp. 97-119
Broadcasting with linearly bounded transmission faults
L. Ga̧sieniec
,
A. Pelc
Discrete Applied Mathematics
83
(1-3), 1998, pp. 121-133
Cycles in the cube-connected cycles graph
Anne Germa
,
Marie-Claude Heydemann
,
Dominique Sotteau
Discrete Applied Mathematics
83
(1-3), 1998, pp. 135-155
Optimal layouts on a chain ATM network
Ornan (Ori) Gerstel
,
Avishai Wool
,
Shmuel Zaks
Discrete Applied Mathematics
83
(1-3), 1998, pp. 157-178
The complexity of broadcasting in planar and decomposable graphs
Andreas Jakoby
,
Rüdiger Reischuk
,
Christian Schindelhauer
Discrete Applied Mathematics
83
(1-3), 1998, pp. 179-206
Line broadcasting in cycles
Jave O. Kane
,
Joseph G. Peters
Discrete Applied Mathematics
83
(1-3), 1998, pp. 207-228
The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
Ralf Klasing
Discrete Applied Mathematics
83
(1-3), 1998, pp. 229-246
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Stéphane Perennes
Discrete Applied Mathematics
83
(1-3), 1998, pp. 247-262
Time-relaxed broadcasting in communication networks
Aditya Shastri
Discrete Applied Mathematics
83
(1-3), 1998, pp. 263-278
Uniform homomorphisms of de Bruijn and Kautz networks
Pavel Tvrdik
,
Rabah Harbane
,
Marie-Claude Heydemann
Discrete Applied Mathematics
83
(1-3), 1998, pp. 279-301
Optimal communication algorithms for Manhattan street networks
Emmanouel A. Varvarigos
Discrete Applied Mathematics
83
(1-3), 1998, pp. 303-326