Journals in DBLP
Networks 1999, volume: 34, number: 2
Hoàng-Oanh Le , Van Bang Le Optimal tree 3-spanners in directed path graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:81-87 [Journal ] Eleni Hadjiconstantinou , Nicos Christofides An efficient implementation of an algorithm for finding K shortest simple paths. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:88-101 [Journal ] Dimitris Bertsimas , Chung-Piaw Teo , Rakesh Vohra Analysis of LP relaxations for multiway and multicut problems. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:102-114 [Journal ] Gary Chartrand , Weizhen Gu , Michelle Schultz , Steven J. Winters Eccentric graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:115-121 [Journal ] Tsutomu Anazawa , Takayuki Kodera , Masakazu Jimbo Optimum requirement spanning trees and reliability of tree networks. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:122-131 [Journal ] Tsutomu Anazawa On a condition for obtaining an explicit solution of optimum requirement spanning tree. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:132-135 [Journal ] Jessen T. Havill , Weizhen Mao Greedy online algorithms for routing permanent virtual circuits. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:136-153 [Journal ] J. Gómez , Ignacio M. Pelayo , Camino Balbuena New large graphs with given degree and diameter six. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:154-161 [Journal ] Michel Gendreau , Jean-Francois Larochelle , Brunilde Sansò A tabu search heuristic for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:162-172 [Journal ]