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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal diameter double-loop networks: Dense optimal families
J.-C. Bermond
,
Dvora Tzvieli
Networks
21
(1), 1991, pp. 1-9
Centroids to center in trees
K.B. Reid
Networks
21
(1), 1991, pp. 11-17
Efficient algorithms for inferring evolutionary trees
Dan Gusfield
Networks
21
(1), 1991, pp. 19-28
Shortest path algorithms using dynamic breadth-first search
Donald Goldfarb
,
Jianxiu Hao
,
Sheng-Roan Kai
Networks
21
(1), 1991, pp. 29-50
On the multiway cut polyhedron
Sunil Chopra
,
M.R. Rao
Networks
21
(1), 1991, pp. 51-89
Consistency and satisfiability of waveform timing specifications
J.A. Brzozowski
,
T. Gahlinger
,
F. Mavaddat
Networks
21
(1), 1991, pp. 91-107
A network equilibrium formulation of market disequilibrium and variational inequalities
Anna Nagurney
,
Lan Zhao
Networks
21
(1), 1991, pp. 109-132
Unbalanced, capacitated
p
-median problems on a chain graph with a continuum of link demands
Hanif D. Sherali
,
Thomas P. Rizzo
Networks
21
(2), 1991, pp. 133-163
Maximum matchings in bipartite graphs via strong spanning trees
M.L. Balinski
,
J. Gonzalez
Networks
21
(2), 1991, pp. 165-179
On the existence of uniformly optimally reliable networks
F.T. Boesch
,
X. Li
,
C. Suffel
Networks
21
(2), 1991, pp. 181-194
Polynomial time algorithms on circular-arc overlap graphs
Toshinobu Kashiwabara
,
Sumio Masuda
,
Kazuo Nakajima
,
Toshio Fujisawa
Networks
21
(2), 1991, pp. 195-203
Faster parametric shortest path and minimum-balance algorithms
Neal E. Young
,
Robert E. Tarjant
,
James B. Orlin
Networks
21
(2), 1991, pp. 205-221
Parametric analysis of optimal facility locations
Margaret L. Brandeau
,
Samuel S. Chiu
Networks
21
(2), 1991, pp. 223-243
Conditional graph connectivity relative to hereditary properties
Ortrud R. Oellermann
Networks
21
(2), 1991, pp. 245-255
Euclidean shortest path in the presence of obstacles
Yong-Mao Chen
,
Prakash Ramanan
Networks
21
(3), 1991, pp. 257-265
The generalized folding-cube network
Sang Bang Choi
,
Arun K. Somani
Networks
21
(3), 1991, pp. 267-294
Minimum weight paths in time-dependent networks
Ariel Orda
,
Raphael Rom
Networks
21
(3), 1991, pp. 295-319
Resilience of partial
k
-tree networks with edge and node failures
Erick Mata-Montero
Networks
21
(3), 1991, pp. 321-344
Reliability covering problems
M.O. Ball
,
J.S. Provan
,
D.R. Shier
Networks
21
(3), 1991, pp. 345-357
On the nonexistence of uniformly optimal graphs for pair-connected reliability
A.T. Amin
,
K.T. Siegrist
,
P.J. Slater
Networks
21
(3), 1991, pp. 359-368
Fault-tolerant extensions of star networks
Robert J. Dawson
,
Abdel Aziz Farrang
Networks
21
(4), 1991, pp. 373-385
Minimal diameter double-loop networks - I. Large infinite optimal families
Dvora Tzvieli
Networks
21
(4), 1991, pp. 387-415
Uniformly-most reliable networks do not always exist
Wendy Myrvold
,
Kim H. Cheung
,
Lavon B. Page
,
Jo Ellen Perry
Networks
21
(4), 1991, pp. 417-419
A compilation of relations between graph invariants - Supplement I
Robert C. Brigham
,
Ronald D. Dutton
Networks
21
(4), 1991, pp. 421-455
Maximum independent number for series-parallel networks
Lih-Hsing Hsu
,
Shih-Yih Wang
Networks
21
(4), 1991, pp. 457-468
Seiten 1
2
>