Networks
, Volume 30
Volume 30, Number 1, August 1997
Khee Meng Koh
,
Eng Guan Tay
:
On optimal orientations of Cartesian products of even cycles and paths.
1-7
Electronic Edition
(link)
BibTeX
Christos Alexopoulos
:
State space partitioning methods for stochastic shortest path problems.
9-21
Electronic Edition
(link)
BibTeX
Bryan Gilbert
,
Wendy J. Myrvold
:
Maximizing spanning trees in almost complete graphs.
23-30
Electronic Edition
(link)
BibTeX
S. Louis Hakimi
,
Edward F. Schmeichel
:
Locating replicas of a database on a network.
31-36
Electronic Edition
(link)
BibTeX
Guoliang Xue
:
Linear time algorithms for computing the most reliable source on an unreliable tree network.
37-45
Electronic Edition
(link)
BibTeX
Zbigniew Lonc
,
Krzysztof Parol
,
Jacek Wojciechowski
:
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.
47-56
Electronic Edition
(link)
BibTeX
Peh H. Ng
,
Ronald L. Rardin
:
Commodity family extended formulations of uncapacitated fixed charge network flow problems.
57-71
Electronic Edition
(link)
BibTeX
Kathryn Fraughnaugh
:
Introduction to graph theory.
73
Electronic Edition
(link)
BibTeX
Volume 30, Number 2, September 1997
Gerard J. Chang
,
Frank K. Hwang
:
Optimality of consecutive and nested tree partitions.
75-80
Electronic Edition
(link)
BibTeX
Frank K. Hwang
,
Paul E. Wright
,
Xiao-Dong Hu
:
Exact reliabilities of most reliable double-loop networks.
81-90
Electronic Edition
(link)
BibTeX
Gengui Zhou
,
Mitsuo Gen
:
A note on genetic algorithms for degree-constrained spanning tree problems.
91-95
Electronic Edition
(link)
BibTeX
Bryan Gilbert
,
Wendy J. Myrvold
:
Maximizing spanning trees in almost complete graphs.
97-104
Electronic Edition
(link)
BibTeX
Jean-François Cordeau
,
Michel Gendreau
,
Gilbert Laporte
:
A tabu search heuristic for periodic and multi-depot vehicle routing problems.
105-119
Electronic Edition
(link)
BibTeX
Feodor F. Dragan
,
Falk Nicolai
:
r-domination problems on homogeneously orderable graphs.
121-131
Electronic Edition
(link)
BibTeX
Bo Yu
,
Joseph Cheriyan
:
The node multiterminal cut polyhedron.
133-148
Electronic Edition
(link)
BibTeX
Volume 30, Number 3, October 1997
Pawel Winter
,
Martin Zachariasen
:
Euclidean Steiner minimum trees: An improved exact algorithm.
149-166
Electronic Edition
(link)
BibTeX
Peter Che Bor Lam
,
Zhongfu Zhang
:
The vertex-face total chromatic number of Halin graphs.
167-170
Electronic Edition
(link)
BibTeX
Russ J. Vander Wiel
,
Nikolaos V. Sahinidis
:
The assignment problem with external interactions.
171-185
Electronic Edition
(link)
BibTeX
Jean-Claude Bermond
,
Zhen Liu
,
Michel Syska
:
Mean eccentricities of de Bruijn networks.
187-203
Electronic Edition
(link)
BibTeX
Jean-Claude Bermond
,
Robin W. Dawes
,
Fahir Ö. Ergincan
:
De Bruijn and Kautz bus networks.
205-218
Electronic Edition
(link)
BibTeX
Dyi-Rong Duh
,
Gen-Huey Chen
:
On the Rabin number problem.
219-230
Electronic Edition
(link)
BibTeX
Volume 30, Number 4, December 1997
Guifang Wang
,
Lianzhu Zhang
:
The structure of max lambda-min
m+1
graphs used in the design of reliable networks.
231-242
Electronic Edition
(link)
BibTeX
David P. Day
,
Ortrud Oellermann
,
Henda C. Swart
:
A characterization of 3-Steiner distance hereditary graphs.
243-253
Electronic Edition
(link)
BibTeX
Serge Lawrencenko
,
Qiang Luo
:
Graphs with given connectivity properties.
255-261
Electronic Edition
(link)
BibTeX
Yves Crama
,
Maarten Oosten
:
The polytope of block diagonal matrices and complete bipartite partitionings.
263-282
Electronic Edition
(link)
BibTeX
Sang Kyu Lee
,
Hyeong-Ah Choi
:
Link-disjoint embedding of complete binary trees in meshes.
283-292
Electronic Edition
(link)
BibTeX
Jose Rodriguez
,
Lorenzo Traldi
:
(K, j)-domination and (K, j)-reliability.
293-306
Electronic Edition
(link)
BibTeX
Copyright ©
Sun May 17 00:15:21 2009 by
Michael Ley
(
ley@uni-trier.de
)