Journal: Networks

Volume 35, Issue 4

248 -- 252Xiaotie Deng, Guojun Li, Wenan Zang. Wavelength allocation on trees of rings
253 -- 259Jianer Chen, Lihua Liu, Weijia Jia. Improvement on vertex cover for low-degree graphs
260 -- 265Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiaohua Jia. Minimizing number of wavelengths in multicast routing trees in WDM networks
266 -- 273Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita. A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
274 -- 278Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu. Orthogonal (g, f)-factorizations in networks
279 -- 286Peng-Jun Wan, Yuanyuan Yang. Load-balanced routing in counter rotated SONET rings
287 -- 301Guo-Hui Lin, Guoliang Xue. Reducing the Steiner problem in four uniform orientations

Volume 35, Issue 3

173 -- 180David Eppstein. Clustering for faster network simplex pivots
181 -- 194Michael C. Ferris, Andrzej Ruszczynski. Robust path choice in networks with failures
195 -- 206William C. K. Yen, C. Y. Tang. The searchlight guarding problem on weighted split graphs and weighted cographs
207 -- 215Jyh-Wen Mao, Chang-Biau Yang. Shortest path routing and fault-tolerant routing on de Bruijn networks
216 -- 222Dukwon Kim, Panos M. Pardalos. Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
223 -- 232Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-in Kim. A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
233 -- 245Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung. Construction schemes for fault-tolerant Hamiltonian graphs

Volume 35, Issue 2

91 -- 108Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice. A truncated primal-infeasible dual-feasible network interior point method
109 -- 117Shaobin Liu, Kam-Hoi Cheng, Xiaoping Liu. Network reliability with node failures
118 -- 138Christos Alexopoulos, Jay A. Jacobson. State space partition algorithms for stochastic systems with applications to minimum spanning trees
139 -- 144Eddie Cheng, Marc J. Lipman. Orienting split-stars and alternating group graphs
145 -- 156Eric Fleury, Yih Huang, Philip K. McKinley. On the performance and feasibility of multicast core selection heuristics
157 -- 160Sheshayya A. Choudum, S. Sivagurunathan. Optimal fault-tolerant networks with a server
161 -- 171Shien-Ching Hwang, Gen-Huey Chen. Cycles in butterfly graphs

Volume 35, Issue 1

1 -- 16Luis Gouveia, Pedro Martins. A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
17 -- 25Jinhyeon Sohn, Sungsoo Park. The single allocation problem in the interacting three-hub network
26 -- 39Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller. Degree-preserving trees
40 -- 55Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng. Source-limited inclusive routing: A new paradigm for multicast communication
56 -- 69Gen-Huey Chen, Jung-Sheng Fu, Jywe-Fei Fang. Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
70 -- 82Enrique Castillo, Angel Cobo, Ruslán Gómez-Nesterkin, Ali S. Hadi. A general framework for functional networks
83 -- 90Qian-Ping Gu, Shietung Peng. Cluster fault-tolerant routing in star graphs