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 YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On optimal orientations of Cartesian products of even cycles and paths
K.M. Koh
,
E.G. Tay
Networks
30
(1), 1997, pp. 1-7
State space partitioning methods for stochastic shortest path problems
Christos Alexopoulos
Networks
30
(1), 1997, pp. 9-21
Maximizing spanning trees in almost complete graphs
Bryan Gilbert
,
Wendy Myrwold
Networks
30
(1), 1997, pp. 23-30
Locating replicas of a database on a network
S. Louis Hakimi
,
Edward F. Schmeichel
Networks
30
(1), 1997, pp. 31-36
Linear time algorithms for computing the most reliable source on an unreliable tree network
Guoling Xue
Networks
30
(1), 1997, pp. 37-45
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
Zbigniew Lonc
,
Krzysztof Parol
,
Jacek M. Wojciechowski
Networks
30
(1), 1997, pp. 47-56
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Peh H. Ng Ng
,
Ronald L. Rardin
Networks
30
(1), 1997, pp. 57-71
Optimality of consecutive and nested tree partitions
G.J. Chang
,
F.K. Hwang
Networks
30
(2), 1997, pp. 75-80
Exact reliabilities of most reliable double-loop networks
Frank K. Hwang
,
Paul E. Wright
,
X.D. Hu
Networks
30
(2), 1997, pp. 81-90
A note on genetic algorithms for degree-constrained spanning tree problems
Gengui Zhou
,
Mitsuo Gen
Networks
30
(2), 1997, pp. 91-95
Maximizing spanning trees in almost complete graphs
Bryan Gilbert
,
Wendy Myrwold
Networks
30
(2), 1997, pp. 97-104
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Jean-François Cordeau
,
Michel Gendreau
,
Gilbert Laporte
Networks
30
(2), 1997, pp. 105-119
r
-domination problems on homogeneously orderable graphs
Feodor F. Dragan
,
Falk Nicolai
Networks
30
(2), 1997, pp. 121-131
The node multiterminal cut polyhedron
Bo Yu
,
Joseph Cheriyan
Networks
30
(2), 1997, pp. 133-148
Euclidean Steiner minimum trees: An improved exact algorithm
Pawel Winter
,
Martin Zachariasen
Networks
30
(3), 1997, pp. 149-166
The vertex-face total chromatic number of Halin graphs
Peter C.B. Lam
,
Zhongfu Zhang
Networks
30
(3), 1997, pp. 167-170
The assignment problem with external interactions
Russ J. Vander Wiel
,
Nikolaos V. Sahinidis
Networks
30
(3), 1997, pp. 171-185
Mean eccentricities of de Bruijn networks
Jean-Claude Bermond
,
Zhen Liu
,
Michel Syska
Networks
30
(3), 1997, pp. 187-203
De Bruijn and Kautz bus networks
Jean-Claude Bermond
,
Robin W. Dawes
,
Fahir Ö. Ergincan
Networks
30
(3), 1997, pp. 205-218
On the Rabin number problem
Dyi-Rong Duh
,
Gen-Huey Chen
Networks
30
(3), 1997, pp. 219-230
The structure of max
\lambda
-min
m_{\lambda+1}
graphs used in the design of reliable networks
Guifang Wang
,
Lianzhu Zhang
Networks
30
(4), 1997, pp. 231-242
A characterization of 3-Steiner distance hereditary graphs
D.P. Day
,
Ortrud R. Oellermann
,
Henda C. Swart
Networks
30
(4), 1997, pp. 243-253
Graphs with given connectivity properties
Serge Lawrencenko
,
Qiang Luo
Networks
30
(4), 1997, pp. 255-261
The polytope of block diagonal matrices and complete bipartite partitionings
Yves Crama
,
Maarten Oosten
Networks
30
(4), 1997, pp. 263-282
Link-disjoint embedding of complete binary trees in meshes
Sang-Kyu Lee
,
Hyeong-Ah Choi
Networks
30
(4), 1997, pp. 283-292
Seiten 1
2
3
>