default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 35
Volume 35, Number 1, January 2000
- Luis Eduardo Neves Gouveia, Pedro Martins:
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. 1-16 - Jinhyeon Sohn, Sungsoo Park:
The single allocation problem in the interacting three-hub network. 17-25 - Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller:
Degree-preserving trees. 26-39 - Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng:
Source-limited inclusive routing: A new paradigm for multicast communication. 40-55 - Gen-Huey Chen, Jung-Sheng Fu, Jywe-Fei Fang:
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems. 56-69 - Enrique F. Castillo, Angel Cobo, Ruslán Gómez-Nesterkin, Ali S. Hadi:
A general framework for functional networks. 70-82 - Qian-Ping Gu, Shietung Peng:
Cluster fault-tolerant routing in star graphs. 83-90
Volume 35, Number 2, March 2000
- Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice:
A truncated primal-infeasible dual-feasible network interior point method. 91-108 - Shaobin Liu, Kam-Hoi Cheng, Xiaoping Liu:
Network reliability with node failures. 109-117 - Christos Alexopoulos, Jay A. Jacobson:
State space partition algorithms for stochastic systems with applications to minimum spanning trees. 118-138 - Eddie Cheng, Marc J. Lipman:
Orienting split-stars and alternating group graphs. 139-144 - Eric Fleury, Yih Huang, Philip K. McKinley:
On the performance and feasibility of multicast core selection heuristics. 145-156 - Sheshayya A. Choudum, S. Sivagurunathan:
Optimal fault-tolerant networks with a server. 157-160 - Shien-Ching Hwang, Gen-Huey Chen:
Cycles in butterfly graphs. 161-171
Volume 35, Number 3, May 2000
- David Eppstein:
Clustering for faster network simplex pivots. 173-180 - Michael C. Ferris, Andrzej Ruszczynski:
Robust path choice in networks with failures. 181-194 - William C. K. Yen, C. Y. Tang:
The searchlight guarding problem on weighted split graphs and weighted cographs. 195-206 - Jyh-Wen Mao, Chang-Biau Yang:
Shortest path routing and fault-tolerant routing on de Bruijn networks. 207-215 - Dukwon Kim, Panos M. Pardalos:
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. 216-222 - Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-in Kim:
A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. 223-232 - Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
Construction schemes for fault-tolerant Hamiltonian graphs. 233-245
Volume 35, Number 4, July 2000
- Xiaotie Deng, Guojun Li, Wenan Zang:
Wavelength allocation on trees of rings. 248-252 - Jianer Chen, Lihua Liu, Weijia Jia:
Improvement on vertex cover for low-degree graphs. 253-259 - Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiaohua Jia:
Minimizing number of wavelengths in multicast routing trees in WDM networks. 260-265 - Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita:
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. 266-273 - Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu:
Orthogonal (g, f)-factorizations in networks. 274-278 - Peng-Jun Wan, Yuanyuan Yang:
Load-balanced routing in counter rotated SONET rings. 279-286 - Guo-Hui Lin, Guoliang Xue:
Reducing the Steiner problem in four uniform orientations. 287-301
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
