Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 36
Volume 36, Number 1, August 2000
- Geir Dahl, Bjørnar Realfsen:
The cardinality-constrained shortest path problem in 2-graphs. 1-8 - S. Trilochan Sastry:
A characterization of the two-commodity network design problem. 9-16 - Walid Ben-Ameur:
Constrained length connectivity and survivable networks. 17-33 - Egon Balas, Maarten Oosten:
On the cycle polytope of a directed graph. 34-46 - Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann:
Minimizing the complexity of an activity network. 47-52 - P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin:
New polynomial-time cycle-canceling algorithms for minimum-cost flows. 53-63 - David DiMarco:
Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree. 64-67
Volume 36, Number 2, September 2000
- Norbert Ascheuer, Matteo Fischetti, Martin Grötschel:
A polyhedral study of the asymmetric traveling salesman problem with time windows. 69-79 - Mark E. T. Horn:
Efficient modeling of travel in networks with time-varying link speeds. 80-90 - Guy Even, Shimon Even:
Embedding interconnection networks in grids via the layered cross product. 91-95 - Petrisor Panaite, Andrzej Pelc:
Impact of topographic information on graph exploration efficiency. 96-103 - Konrad J. Swanepoel:
The local Steiner problem in normed planes. 104-113 - Colin McDiarmid, Bruce A. Reed:
Channel assignment and weighted coloring. 114-117 - Guillaume Fertin, Roger Labahn:
Compounding of gossip graphs. 126-137 - Celso C. Ribeiro, Maurício C. de Souza:
Tabu search for the Steiner problem in graphs. 138-146
Volume 36, Number 3, October 2000
- Esther M. Arkin, Refael Hassin:
Minimum-diameter covering problems. 147-155 - Martin Erwig:
The graph Voronoi diagram with applications. 156-163 - José Gómez, Eduardo A. Canale, Xavier Muñoz:
On the unilateral (Delta, D*)-problem. 164-171 - Zeev Nutov:
Approximating multiroot 3-outconnected subgraphs. 172-179 - Lali Barrière, Josep Fàbrega, Ester Simó, Marisa Zaragozá:
Fault-tolerant routings in chordal ring networks. 180-190 - Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Low-congested interval routing schemes for hypercubelike networks. 191-201
Volume 36, Number 4, December 2000
- Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The full-degree spanning tree problem. 203-209 - Steven Chamberland, Brunilde Sansò:
Topological expansion of multiple-ring metropolitan area networks. 210-224 - Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Hamiltonian-laceability of star graphs. 225-232 - Peiwu Zhao, Rajan Batta:
An aggregation approach to solving the network p-median problem with link demands. 233-241
a service of 
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-04-22 20:02 CEST 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:
