External Links

    Journal: Networks

    Volume 30, Issue 4

    231 -- 242Guifang Wang, Lianzhu Zhang. The structure of max lambda-min ::m+1:: graphs used in the design of reliable networks
    243 -- 253David P. Day, Ortrud Oellermann, Henda C. Swart. A characterization of 3-Steiner distance hereditary graphs
    255 -- 261Serge Lawrencenko, Qiang Luo. Graphs with given connectivity properties
    263 -- 282Yves Crama, Maarten Oosten. The polytope of block diagonal matrices and complete bipartite partitionings
    283 -- 292Sang Kyu Lee, Hyeong-Ah Choi. Link-disjoint embedding of complete binary trees in meshes
    293 -- 306Jose Rodriguez, Lorenzo Traldi. (K, j)-domination and (K, j)-reliability

    Volume 30, Issue 3

    149 -- 166Pawel Winter, Martin Zachariasen. Euclidean Steiner minimum trees: An improved exact algorithm
    167 -- 170Peter Che Bor Lam, Zhongfu Zhang. The vertex-face total chromatic number of Halin graphs
    171 -- 185Russ J. Vander Wiel, Nikolaos V. Sahinidis. The assignment problem with external interactions
    187 -- 203Jean-Claude Bermond, Zhen Liu, Michel Syska. Mean eccentricities of de Bruijn networks
    205 -- 218Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan. De Bruijn and Kautz bus networks
    219 -- 230Dyi-Rong Duh, Gen-Huey Chen. On the Rabin number problem

    Volume 30, Issue 2

    75 -- 80Gerard J. Chang, Frank K. Hwang. Optimality of consecutive and nested tree partitions
    81 -- 90Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu. Exact reliabilities of most reliable double-loop networks
    91 -- 95Gengui Zhou, Mitsuo Gen. A note on genetic algorithms for degree-constrained spanning tree problems
    97 -- 104Bryan Gilbert, Wendy J. Myrvold. Maximizing spanning trees in almost complete graphs
    105 -- 119Jean-François Cordeau, Michel Gendreau, Gilbert Laporte. A tabu search heuristic for periodic and multi-depot vehicle routing problems
    121 -- 131Feodor F. Dragan, Falk Nicolai. r-domination problems on homogeneously orderable graphs
    133 -- 148Bo Yu, Joseph Cheriyan. The node multiterminal cut polyhedron

    Volume 30, Issue 1

    1 -- 7Khee Meng Koh, Eng Guan Tay. On optimal orientations of Cartesian products of even cycles and paths
    9 -- 21Christos Alexopoulos. State space partitioning methods for stochastic shortest path problems
    23 -- 30Bryan Gilbert, Wendy J. Myrvold. Maximizing spanning trees in almost complete graphs
    31 -- 36S. Louis Hakimi, Edward F. Schmeichel. Locating replicas of a database on a network
    37 -- 45Guoliang Xue. Linear time algorithms for computing the most reliable source on an unreliable tree network
    47 -- 56Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski. On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
    57 -- 71Peh H. Ng, Ronald L. Rardin. Commodity family extended formulations of uncapacitated fixed charge network flow problems
    73 -- 0Kathryn Fraughnaugh. Introduction to graph theory
    runs on