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=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Balanced network flows - I. A unifying framework for design and analysis of matching algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 1-28
Balanced network flows - II. Simple augmentation algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 29-41
Balanced network flows - III. Strongly polynomial augmentation algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
33
(1), 1999, pp. 43-56
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Rainer E. Burkard
,
Karin Feldbacher
,
Bettina Klinz
,
Gerhard J. Woeginger
Networks
33
(1), 1999, pp. 57-70
Small congestion embedding of graphs into hypercubes
Akira Matsubayashi
,
Shuichi Ueno
Networks
33
(1), 1999, pp. 71-77
Multicriteria network location problems with sum objectives
Horst W. Hamacher
,
Martine Labbé
,
Stefan Nickel
Networks
33
(2), 1999, pp. 79-92
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation
Anna Nagurney
,
Stavros Siokos
Networks
33
(2), 1999, pp. 93-108
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
Ishwar Murthy
,
Phil K. Seo
Networks
33
(2), 1999, pp. 109-124
Rectilinear full Steiner tree generation
Martin Zachariasen
Networks
33
(2), 1999, pp. 125-143
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
M. Brazil
,
D.A. Thomas
,
J.F. Weng
Networks
33
(2), 1999, pp. 145-155
Super edge connectivity properties of connected edge symmetric graphs
Qiaoliang Li
,
Qiao Li
Networks
33
(2), 1999, pp. 157-159
On diameter of permutation graphs
Weizhen Gu
Networks
33
(3), 1999, pp. 161-166
Transmissions in a network with capacities and delays
Dimitrios Kagaris
,
Grammati E. Pantziou
,
Spyros Tragoudas
,
Christos D. Zaroliagis
Networks
33
(3), 1999, pp. 167-174
Pseudo-Gilbert-Steiner trees
D. Trietsch
,
J.F. Weng
Networks
33
(3), 1999, pp. 175-178
All-to-all communication for some wavelength-routed all-optical networks
Bruno Beauquier
Networks
33
(3), 1999, pp. 179-187
A note on the bottleneck graph partition problem
Bettina Klinz
,
Gerhard J. Woeginger
Networks
33
(3), 1999, pp. 189-191
An expert system for coherent assessment of probabilities in multigraph models
E. Castillo
,
A.S. Hadi
,
F. Jubete
,
C. Solares
Networks
33
(3), 1999, pp. 193-206
The probabilistic longest path problem
Cécile Murat
,
Vangelis Th. Paschos
Networks
33
(3), 1999, pp. 207-219
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
Yu-Chee Tseng
,
Yuh-Shyan Chen
,
Tong-Ying Juang
,
Chiou-Jyu Chang
Networks
33
(3), 1999, pp. 221-231
Various results on the toughness of graphs
Hajo Broersma
,
Erik Engbers
,
Huib Trommel
Networks
33
(3), 1999, pp. 233-238
Multidimensional assortment problem with an application
Ashish Tripathy
,
Haldun Süral
,
Yigal Gerchak
Networks
33
(3), 1999, pp. 239-245
Upper and lower bounds for the average-case complexity of path-search
Nicholas Pippenger
Networks
33
(4), 1999, pp. 249-259
Characterizing bit permutation networks
Gerard J. Chang
,
Frank K. Hwang
,
Li-Da Tong
Networks
33
(4), 1999, pp. 261-267
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
G.W. Richards
,
F.K. Hwang
Networks
33
(4), 1999, pp. 269-291
Strictly nonblocking conference networks using high-dimensional meshes
Yi Du
,
Gerald M. Masson
Networks
33
(4), 1999, pp. 293-308