Networks, Volume 29

Volume 29, Number 1, January 1997

Amotz Bar-Noy, Shlomo Kipnis:
Multiple message broadcasting in the postal model. 1-10
Ariel Orda, Raphael Rom:
Optimal packet fragmentation and routing in computer networks. 11-28
Ramesh S. Sankaranarayana:
Tracking the P-NP boundary for well-covered graphs. 29-37
Toru Hasunuma, Yukio Shibata:
Counting small cycles in generalized de Bruijn digraphs. 39-47
Savio S. H. Tse, Francis C. M. Lau:
A lower bound for interval routing in general networks. 49-53
Matteo Fischetti, Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. 55-67
Konstantinos Kalpakis, Yaacov Yesha:
On the bisection width of the transposition network. 69-76

Stephen G. Penrice:
Balanced graphs and network flows. 77-80
Chin-Chen Chang, Wen-Bin Wu:
A secure voting system on a public network. 81-87
Cees Duin, Stefan Voß:
Efficient path and vertex exchange in steiner tree algorithms. 89-105
Akiyoshi Shioura, Maiko Shigeno:
The tree center problems and the relationship with the bottleneck knapsack problems. 107-110
Zhi-Long Chen, Warren B. Powell:
A note on Bertsekas' small-label-first strategy. 111-116
Hosam M. F. AboElFotoh:
Algorithms for computing message delay for wireless networks. 117-124
Stefano Pallottino, Maria Grazia Scutellà:
Dual algorithms for the shortest path tree problem. 125-133

Yixun Lin:
Minimum bandwidth problem for embedding graphs in cycles. 135-140
X. Cai, Ton Kloks, C. K. Wong:
Time-varying shortest path problems with constraints. 141-150
Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
Minimum-weight cycles in 3-separable graphs. 151-160
Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. 161-171
Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP for graph planarization. 173-189

Dilip Chhajed:
Edge coloring a k-tree into two smaller trees. 191-194
De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi:
Reliability analysis of replicated and-or graphs. 195-203
Esther M. Arkin, Refael Hassin, Limor Klein:
Restricted delivery problems on a network. 205-216
Daniel Gagliardi, Marty Lewinter:
An infinite class of reach-preservable graphs. 217-218
Shimon Even, Ami Litman:
Layered cross product - A technique to construct interconnection networks. 219-223
Shin-Yeu Lin, Ch'i-Hsin Lin:
A computationally efficient method for nonlinear multicommodity network flow problems. 225-244
Takao Asano:
Constructing a bipartite graph of maximum connectivity with prescribed degrees. 245-263

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