Networks, Volume 31

Volume 31, Number 1, January 1998

Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. 1-10
Stefan Engevall, Maud Göthe-Lundgren, Peter Värbrand:
A strong lower bound for the Node Weighted Steiner Tree Problem. 11-17
L. Ganapathy, Kunhiraman Nair:
On capacitated stochastic chain problems in a network. 19-27
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Tough enough chordal graphs are Hamiltonian. 29-38
Abilio Lucena, J. E. Beasley:
A branch and cut algorithm for the Steiner problem in graphs. 39-59

Qiaoliang Li, Qiao Li:
Reliability analysis of circulant graphs. 61-65
Luisa Gargano, Adele A. Rescigno:
Fast collective communication by packets in the postal model. 67-79
Igor Averbakh, Oded Berman:
Location problems with grouped structure of demand: Complexity and algorithms. 81-92
Bintong Chen, Chin-Shien Lin:
Minmax-regret robust 1-median location on a tree. 93-103
Hui-Ling Huang, Gen-Huey Chen:
Topological properties and algorithms for two-level hypernet networks. 105-118
Ferenc Friedler, L. T. Fan, Balázs Imreh:
Process network synthesis: Problem definition. 119-124
Charles Delorme, Oscar Ordaz, Domingo Quiroz:
Tools for studying paths and cycles in digraphs. 125-148

Christopher L. Cox:
Flow-dependent networks: Existence and behavior at Steiner points. 149-156
Hiro Ito, Mitsuo Yokoyama:
Edge connectivity between nodes and node-subsets. 157-163
Shane Dye, Asgeir Tomasgard, Stein W. Wallace:
Feasibility in transportation networks with supply eating arcs. 165-176
Andreas Brandstädt, Feodor F. Dragan:
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. 177-182
Yang Xiang:
Verification of DAG structures in cooperative belief network-based multiagent systems. 183-191
Irina Ioachim, Sylvie Gélinas, François Soumis, Jacques Desrosiers:
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. 193-204

Dong X. Shaw, Geon Cho:
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. 205-216
Daniel Gross, John T. Saccoman:
Uniformly optimally reliable graphs. 217-225
Philippe Mahey, Adam Ouorou, Larry J. LeBlanc, Jerome Chifflet:
A new proximal decomposition algorithm for routing in telecommunication networks. 227-238
Dominique Barth, Petrisor Panaite:
Undirected graphs rearrangeable by 2-length walks. 239-247
Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan:
Solving the all-pair shortest path query problem on interval and circular-arc graphs. 249-258
Hanif D. Sherali, Kaan Ozbay, Shivaram Subramanian:
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. 259-272
Uwe H. Suhl, Heinrich Hilbert:
A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs. 273-282
Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani:
Approximating Steiner trees in graphs with restricted weights. 283-292
Darko Skorin-Kapov:
Hub network games. 293-302

Last update Tue Feb 14 04:21:45 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page