@article{Koh-Tay/97a,
AUTHOR = {Koh, K.M. and Tay, E.G.},
TITLE = {On optimal orientations of Cartesian products of even cycles and paths},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {1-7},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Alexopoulos/97,
AUTHOR = {Alexopoulos, Christos},
TITLE = {State space partitioning methods for stochastic shortest path problems},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {9-21},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gilbert-Myrwold/97,
AUTHOR = {Gilbert, Bryan and Myrwold, Wendy},
TITLE = {Maximizing spanning trees in almost complete graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {23-30},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hakimi-Schmeichel/97,
AUTHOR = {Hakimi, S. Louis and Schmeichel, Edward F.},
TITLE = {Locating replicas of a database on a network},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {31-36},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Xue/97c,
AUTHOR = {Xue, Guoling},
TITLE = {Linear time algorithms for computing the most reliable source on an unreliable tree network},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {37-45},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lonc-Parol-Wojciechowski/97,
AUTHOR = {Lonc, Zbigniew and Parol, Krzysztof and Wojciechowski, Jacek M.},
TITLE = {On the asymptotic behavior of the maximum number of spanning trees in circulant graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {47-56},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Ng-Rardin/97,
AUTHOR = {Ng, Peh H. Ng and Rardin, Ronald L.},
TITLE = {Commodity family extended formulations of uncapacitated fixed charge network flow problems},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {1},
PAGES = {57-71},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chang-Hwang/97a,
AUTHOR = {Chang, G.J. and Hwang, F.K.},
TITLE = {Optimality of consecutive and nested tree partitions},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {75-80},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hwang-Wright-Hu/97,
AUTHOR = {Hwang, Frank K. and Wright, Paul E. and Hu, X.D.},
TITLE = {Exact reliabilities of most reliable double-loop networks},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {81-90},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Zhou-Gen/97,
AUTHOR = {Zhou, Gengui and Gen, Mitsuo},
TITLE = {A note on genetic algorithms for degree-constrained spanning tree problems},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {91-95},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gilbert-Myrwold/97a,
AUTHOR = {Gilbert, Bryan and Myrwold, Wendy},
TITLE = {Maximizing spanning trees in almost complete graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {97-104},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Cordeau-Gendreau-Laporte/97,
AUTHOR = {Cordeau, Jean-Fran{\c{c}}ois and Gendreau, Michel and Laporte, Gilbert},
TITLE = {A tabu search heuristic for periodic and multi-depot vehicle routing problems},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {105-119},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Dragan-Nicolai/97,
AUTHOR = {Dragan, Feodor F. and Nicolai, Falk},
TITLE = {$r$-domination problems on homogeneously orderable graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {121-131},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Yu-Cheriyan/97,
AUTHOR = {Yu, Bo and Cheriyan, Joseph},
TITLE = {The node multiterminal cut polyhedron},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {2},
PAGES = {133-148},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Winter-Zachariasen/97,
AUTHOR = {Winter, Pawel and Zachariasen, Martin},
TITLE = {Euclidean Steiner minimum trees: An improved exact algorithm},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {149-166},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lam-Zhang/97,
AUTHOR = {Lam, Peter C.B. and Zhang, Zhongfu},
TITLE = {The vertex-face total chromatic number of Halin graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {167-170},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Vander_Wiel-Sahinidis/97,
AUTHOR = {Vander Wiel, Russ J. and Sahinidis, Nikolaos V.},
TITLE = {The assignment problem with external interactions},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {171-185},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Bermond-Liu-Syska/97,
AUTHOR = {Bermond, Jean-Claude and Liu, Zhen and Syska, Michel},
TITLE = {Mean eccentricities of de Bruijn networks},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {187-203},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Bermond-Dawes-Ergincan/97,
AUTHOR = {Bermond, Jean-Claude and Dawes, Robin W. and Ergincan, Fahir {\"O}.},
TITLE = {De Bruijn and Kautz bus networks},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {205-218},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Duh-Chen/97,
AUTHOR = {Duh, Dyi-Rong and Chen, Gen-Huey},
TITLE = {On the Rabin number problem},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {3},
PAGES = {219-230},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Wang-Zhang/97,
AUTHOR = {Wang, Guifang and Zhang, Lianzhu},
TITLE = {The structure of max $\lambda$-min $m_{\lambda+1}$ graphs used in the design of reliable networks},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {231-242},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Day-Oellermann-Swart/97,
AUTHOR = {Day, D.P. and Oellermann, Ortrud R. and Swart, Henda C.},
TITLE = {A characterization of 3-Steiner distance hereditary graphs},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {243-253},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lawrencenko-Luo/97,
AUTHOR = {Lawrencenko, Serge and Luo, Qiang},
TITLE = {Graphs with given connectivity properties},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {255-261},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Crama-Oosten/97,
AUTHOR = {Crama, Yves and Oosten, Maarten},
TITLE = {The polytope of block diagonal matrices and complete bipartite partitionings},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {263-282},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lee-Choi/97,
AUTHOR = {Lee, Sang-Kyu and Choi, Hyeong-Ah},
TITLE = {Link-disjoint embedding of complete binary trees in meshes},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {283-292},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Rodriguez-Traldi/97,
AUTHOR = {Rodriguez, Jose and Traldi, Lorenzo},
TITLE = {$(K,j)$-domination and $(K,j)$-reliability},
JOURNAL = {Networks},
VOLUME = {30},
NUMBER = {4},
PAGES = {293-306},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Bar-Noy-Kipnis/97,
AUTHOR = {Bar-Noy, Amotz and Kipnis, Shlomo},
TITLE = {Multiple message broadcasting in the postal model},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {1-10},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Orda-Rom/97,
AUTHOR = {Orda, Ariel and Rom, Raphael},
TITLE = {Optimal packet fragmentation and routing in computer networks},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {11-28},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Sankaranarayana/97,
AUTHOR = {Sankaranarayana, Ramesh S.},
TITLE = {Tracking the $P-NP$ boundary for well-covered graphs},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {29-37},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Hasunuma-Shibata/97b,
AUTHOR = {Hasunuma, Toru and Shibata, Yukio},
TITLE = {Counting small cycles in generalized de Bruijn digraphs},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {39-47},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Tse-Lau/97,
AUTHOR = {Tse, Savio S.H. and Lau, Francis C.M.},
TITLE = {A lower bound for interval routing in general networks},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {49-53},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Fischetti-Vigo/97,
AUTHOR = {Fischetti, Matteo and Vigo, Daniele},
TITLE = {A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {55-67},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Kalpakis-Yesha/97,
AUTHOR = {Kalpakis, Konstantinos and Yesha, Yaacov},
TITLE = {On the bisection width of the transposition network},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {1},
PAGES = {69-76},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Penrice/97a,
AUTHOR = {Penrice, Stephen G.},
TITLE = {Balanced graphs and network flows},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {77-80},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chang-Wu/97,
AUTHOR = {Chang, Chin-Chen and Wu, Wen-Bin},
TITLE = {A secure voting system on a public network},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {81-87},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Duin-Voss/97,
AUTHOR = {Duin, Cees and Vo{\"ss}, Stefan},
TITLE = {Efficient path and vertex exchange in Steiner tree algorithms},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {89-105},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Shioura-Shigeno/97,
AUTHOR = {Shioura, Akiyoshi and Shigeno, Maiko},
TITLE = {The tree center problems and the relationship with the bottleneck knapsack problems},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {107-110},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chen-Powell/97,
AUTHOR = {Chen, Zhi-Long and Powell, Warren B.},
TITLE = {A note on Bertsekas' small-label-first strategy},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {111-116},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{AboElFotoh/97,
AUTHOR = {AboElFotoh, Hosam M.F.},
TITLE = {Algorithms for computing message delay for wireless networks},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {117-124},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Pallottino-Scutella/97,
AUTHOR = {Pallottino, Stefano and Scutell{\`{a}}, Maria Grazia},
TITLE = {Dual algorithms for the shortest path tree problem},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {2},
PAGES = {125-133},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lin/97,
AUTHOR = {Lin, Yixun},
TITLE = {Minimum bandwidth problem for embedding graphs in cycles},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {3},
PAGES = {135-140},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Cai-Kloks-Wong/97,
AUTHOR = {Cai, X. and Kloks, T. and Wong, C.K.},
TITLE = {Time-varying shortest path problems with constraints},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {3},
PAGES = {141-149},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Coullard-Gardner-Wagner/97,
AUTHOR = {Coullard, Collette R. and Gardner, L. Leslie and Wagner, Donald K.},
TITLE = {Minimum-weight cycles in 3-separable graphs},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {3},
PAGES = {151-160},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Sharaiha-Gendreau-Laporte-Osman/97,
AUTHOR = {Sharaiha, Yazid M. and Gendreau, Michel and Laporte, Gilbert and Osman, Ibrahim H.},
TITLE = {A tabu search algorithm for the capacitated shortest spanning tree problem},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {3},
PAGES = {161-171},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Resende-Ribeiro/97,
AUTHOR = {Resende, Mauricio G.C. and Ribeiro, Celso C.},
TITLE = {A GRASP for graph planarization},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {3},
PAGES = {173-189},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Chhajed/97,
AUTHOR = {Chhajed, Dilip},
TITLE = {Edge coloring a $K$-tree into two smaller trees},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {191-194},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Liang-Jan-Tripahti/97,
AUTHOR = {Liang, De-Ron and Jan, Rong-Hong and Tripahti, Satish K.},
TITLE = {Reliability analysis of replicated and-or graphs},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {195-203},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Arkin-Hassin-Klein/97,
AUTHOR = {Arkin, Esther M. and Hassin, Refael and Klein, Limor},
TITLE = {Restricted delivery problems on a network},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {205-216},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Gagliardi-Lewinter/97,
AUTHOR = {Gagliardi, Daniel and Lewinter, Marty},
TITLE = {An infinite class of reach-preservable graphs},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {217-218},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Even-Litman/97,
AUTHOR = {Even, Shimon and Litman, Ami},
TITLE = {Layered cross product --- A technique to construct interconnection networks},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {219-223},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Lin-Lin/97a,
AUTHOR = {Lin, Shin-Yeu and Lin, Ch'i-Hsin},
TITLE = {A computationally efficient method for nonlinear multicommodity network flow problems},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {225-244},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}
@article{Asano/97a,
AUTHOR = {Asano, Takao},
TITLE = {Constructing a bipartite graph of maximum connectivity with prescribed degrees},
JOURNAL = {Networks},
VOLUME = {29},
NUMBER = {4},
PAGES = {245-263},
YEAR = {1997},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {New York-Chichester-Weinheim-Brisbane-Singapore-Toronto},
}