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=Networks AND Volume=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding grids into grids: Techniques for large compression ratios
John A. Ellis
Networks
27
(1), 1996, pp. 1-17
Node fault tolerance in graphs
Frank Harary
,
John P. Hayes
Networks
27
(1), 1996, pp. 19-23
A feedback strategy for periodic network flows
Franco Blanchini
,
Maurice Queyranne
,
Franca Rinaldi
,
Walter Ukovich
Networks
27
(1), 1996, pp. 25-34
A comparative study of doubly connected directed topologies for LANs and MANs
Tein Y. Chung
,
Dharma P. Agrawal
,
Suresh Rai
,
Tzau J. Chung
Networks
27
(1), 1996, pp. 35-51
Components and graph automorphisms of standard
2 \times 2
-switch banyan networks
E. Hotzel
Networks
27
(1), 1996, pp. 53-71
A modified Melzak procedure for computing node-weighted Steiner trees
Alice Underwood
Networks
27
(1), 1996, pp. 73-79
Package routing in transportation networks with fixed vehicle schedules
Lloyd Greenwald
,
Thomas Dean
Networks
27
(1), 1996, pp. 81-93
An optimal algorithm for the mixed Chinese Postman problem
Yves Nobert
,
Jean-Claude Picard
Networks
27
(2), 1996, pp. 95-108
Network synthesis with few edges
Kalyan T. Talluri
Networks
27
(2), 1996, pp. 109-115
Disconnecting sets in single and two-terminal-pair networks
Frieda Granot
,
Michal Penn
,
Maurice Queyranne
Networks
27
(2), 1996, pp. 117-123
Uniformly least reliable graphs
L. Petingi
,
J.T. Saccoman
,
L. Schoppmann
Networks
27
(2), 1996, pp. 125-131
Stochastic shortest path problems with recourse
George H. Polychronopoulos
,
John N. Tsitsiklis
Networks
27
(2), 1996, pp. 133-143
Transmitting on various network topologies
Tung-Yang Ho
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Networks
27
(2), 1996, pp. 145-157
Circuit-switched row-column broadcasting in torus and mesh networks
Ju-Young Lee Park
,
Hyeong-Ah Choi
Networks
27
(2), 1996, pp. 159-167
A linear time algorithm to recognize circular permutation graphs
R. Sritharan
Networks
27
(3), 1996, pp. 171-174
Complexity of spanning tree problems with leaf-dependent objectives
Mauro Dell'Amico
,
Martine Labbé
,
Francesco Maffioli
Networks
27
(3), 1996, pp. 175-181
Broadcasting with universal lists
Krzysztof Diks
,
Andrzej Pelc
Networks
27
(3), 1996, pp. 183-196
Star-factors and
k
-bounded total domination
Georg Gunther
,
Bert Hartnell
,
Douglas Rall
Networks
27
(3), 1996, pp. 197-201
Optimally edge fault-tolerant trees
Hung-Kuei Ku
,
John P. Hayes
Networks
27
(3), 1996, pp. 203-214
A simple
O(n^2
algorithm for the all-pairs shortest path problem on an interval graph
Prakash Mirchandani
Networks
27
(3), 1996, pp. 215-217
A single facility location problem on a tree with unreliable edges
Emanuel Melachrinoudis
,
Mary E. Helander
Networks
27
(3), 1996, pp. 219-237
Minimum gossip bus networks
Pierre Fraigniaud
,
Christian Laforest
Networks
27
(3), 1996, pp. 239-251
An addendum to the most vital edges of matching in a bipartite graph
A. Volgenant
Networks
27
(3), 1996, pp. 253-253
A response to Volgenant's addendum on the most vital edges
Chun-Nan Hung
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Networks
27
(3), 1996, pp. 255-255
The wide-diameter of the
n
-dimensional toroidal mesh
Yoshiyasu Ishigami
Networks
27
(4), 1996, pp. 257-266
Seiten 1
2
>