default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 46
Volume 46, Number 1, August 2005
- Hervé Kerivin, Ali Ridha Mahjoub:
Design of Survivable Networks: A survey. 1-21 - Thomas Boulogne, Eitan Altman:
Competitive routing in multicast communications. 22-35 - Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro
, Mikkel Thorup:
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. 36-56 - Sébastien Roch, Gilles Savard, Patrice Marcotte:
An approximation algorithm for Stackelberg network pricing. 57-67
Volume 46, Number 2, August 2005
- G. W. Groves, J. le Roux, Jan H. van Vuuren:
On a routing and scheduling problem concerning multiple edge traversals in graphs. 69-81 - J. Gómez Martí:
On large (Delta, 6)-Graphs. 82-87 - Nenad Obradoviç, Joseph G. Peters, Goran Ruzic:
Reliable broadcasting in double loop networks. 88-97 - W. Matthew Carlyle, R. Kevin Wood:
Near-shortest and K-shortest simple paths. 98-109 - Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau:
Mutually independent hamiltonian paths in star networks. 110-117
Volume 46, Number 3, October 2005
- Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Minimum path bases and relevant paths. 119-123 - Jiong Guo, Rolf Niedermeier:
Fixed-parameter tractability and data reduction for multicut in trees. 124-135 - Toru Kojima:
Wide diameter and minimum length of disjoint Menger path systems. 136-141 - Marcus Brazil, Pawel Winter, Martin Zachariasen:
Flexibility of Steiner trees in uniform orientation metrics. 142-153 - Eddie Cheng, William A. Lindsey, Daniel E. Steffy:
Maximal vertex-connectivity of. 154-162
Volume 46, Number 4, December 2005
- Achille Pattavina, Gino L. Tesei:
Nonblocking conditions of multicast three-stage interconnection networks. 163-170 - Chiuyuan Chen, Frank K. Hwang, James K. Lan:
Equivalence of buddy networks with arbitrary number of stages. 171-176 - Jennifer A. Horne, J. Cole Smith:
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs. 177-185 - Jennifer A. Horne, J. Cole Smith:
A dynamic programming algorithm for the conditional covering problem on tree graphs. 186-197 - Deepak Warrier, Wilbert E. Wilhelm, Jeffrey S. Warren, Illya V. Hicks:
A branch-and-price approach for the maximum weight independent set problem. 198-209
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:32 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:
