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=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiple message broadcasting in the postal model
Amotz Bar-Noy
,
Shlomo Kipnis
Networks
29
(1), 1997, pp. 1-10
Optimal packet fragmentation and routing in computer networks
Ariel Orda
,
Raphael Rom
Networks
29
(1), 1997, pp. 11-28
Tracking the
P-NP
boundary for well-covered graphs
Ramesh S. Sankaranarayana
Networks
29
(1), 1997, pp. 29-37
Counting small cycles in generalized de Bruijn digraphs
Toru Hasunuma
,
Yukio Shibata
Networks
29
(1), 1997, pp. 39-47
A lower bound for interval routing in general networks
Savio S.H. Tse
,
Francis C.M. Lau
Networks
29
(1), 1997, pp. 49-53
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
Matteo Fischetti
,
Daniele Vigo
Networks
29
(1), 1997, pp. 55-67
On the bisection width of the transposition network
Konstantinos Kalpakis
,
Yaacov Yesha
Networks
29
(1), 1997, pp. 69-76
Balanced graphs and network flows
Stephen G. Penrice
Networks
29
(2), 1997, pp. 77-80
A secure voting system on a public network
Chin-Chen Chang
,
Wen-Bin Wu
Networks
29
(2), 1997, pp. 81-87
Efficient path and vertex exchange in Steiner tree algorithms
Cees Duin
,
Stefan Voss̈
Networks
29
(2), 1997, pp. 89-105
The tree center problems and the relationship with the bottleneck knapsack problems
Akiyoshi Shioura
,
Maiko Shigeno
Networks
29
(2), 1997, pp. 107-110
A note on Bertsekas' small-label-first strategy
Zhi-Long Chen
,
Warren B. Powell
Networks
29
(2), 1997, pp. 111-116
Algorithms for computing message delay for wireless networks
Hosam M.F. AboElFotoh
Networks
29
(2), 1997, pp. 117-124
Dual algorithms for the shortest path tree problem
Stefano Pallottino
,
Maria Grazia Scutellà
Networks
29
(2), 1997, pp. 125-133
Minimum bandwidth problem for embedding graphs in cycles
Yixun Lin
Networks
29
(3), 1997, pp. 135-140
Time-varying shortest path problems with constraints
X. Cai
,
T. Kloks
,
C.K. Wong
Networks
29
(3), 1997, pp. 141-149
Minimum-weight cycles in 3-separable graphs
Collette R. Coullard
,
L. Leslie Gardner
,
Donald K. Wagner
Networks
29
(3), 1997, pp. 151-160
A tabu search algorithm for the capacitated shortest spanning tree problem
Yazid M. Sharaiha
,
Michel Gendreau
,
Gilbert Laporte
,
Ibrahim H. Osman
Networks
29
(3), 1997, pp. 161-171
A GRASP for graph planarization
Mauricio G.C. Resende
,
Celso C. Ribeiro
Networks
29
(3), 1997, pp. 173-189
Edge coloring a
K
-tree into two smaller trees
Dilip Chhajed
Networks
29
(4), 1997, pp. 191-194
Reliability analysis of replicated and-or graphs
De-Ron Liang
,
Rong-Hong Jan
,
Satish K. Tripahti
Networks
29
(4), 1997, pp. 195-203
Restricted delivery problems on a network
Esther M. Arkin
,
Refael Hassin
,
Limor Klein
Networks
29
(4), 1997, pp. 205-216
An infinite class of reach-preservable graphs
Daniel Gagliardi
,
Marty Lewinter
Networks
29
(4), 1997, pp. 217-218
Layered cross product - A technique to construct interconnection networks
Shimon Even
,
Ami Litman
Networks
29
(4), 1997, pp. 219-223
A computationally efficient method for nonlinear multicommodity network flow problems
Shin-Yeu Lin
,
Ch'i-Hsin Lin
Networks
29
(4), 1997, pp. 225-244
Seiten 1
2
>