default search action
Networks, Volume 10
Volume 10, Number 1, Spring 1980
- Donald Watson:
Network methods in models of production. 1-15 - Victor V. Masch:
The cyclic method of solving the transshipment problem with an additional linear constraint. 17-31 - Bruce E. Peterson:
A cut-flow procedure for transportation network optimization. 33-43 - Yash P. Aneja, K. P. K. Nair:
Maximal expected flow in a network subject to arc failures. 45-57 - Arthur M. Farley:
Minimum-time line broadcast networks. 59-70 - Randall R. Willie:
A theorem concerning cyclic directed graphs with applications to network reliability. 71-78 - Paul D. Seymour
:
Four-terminus flows. 79-86 - Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman:
Maximum degree in graphs of diameter 2. 87-90
Volume 10, Number 2, Summer 1980
- Paolo M. Camerini, Luigi Fratta, Francesco Maffioli:
The k best spanning arborescences of a network. 91-109 - Prathima Agrawal, Melvin A. Breuer:
A probabilistic model for the analysis of the routing process for circuits. 111-127 - T. Ozawa:
Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter. 129-142 - Richard M. Karp:
An algorithm to solve the m × n assignment problem in expected time O(mn log n). 143-152 - Michael O. Ball:
Complexity of network reliability computations. 153-165 - Yash P. Aneja:
An integer linear programming approach to the steiner problem in graphs. 167-178
- Isao Shirakawa:
Some comments on permutation layout. 179-182
Volume 10, Number 3
- M. Cutler:
Efficient special case algorithms for the n-line planar traveling salesman problem. 183-195 - Andrés Weintraub
An algorithm for the traffic assignment problem. 197-209 - Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi:
Total domination in graphs. 211-219 - Leonard Kleinrock, Farouk Kamoun
Optimal clustering structures for hierarchical topological design of large computer networks. 221-248 - K. Takamizawa, Takao Nishizeki, Nobuji Saito:
An algorithm for finding a short closed spanning walk in a graph. 249-263 - Edward Minieka:
Conditional centers and medians of a graph. 265-272 - Frank Harary, Jerald A. Kabell:
Monotone sequences of graphical invariants. 273-275
Volume 10, Number 4, Winter 1980
- Douglas R. Shier, Christoph Witzgall:
Arc tolerances in shortest path and network flow problems. 277-291 - Gabriel Y. Handler, Israel Zang:
A dual algorithm for the constrained shortest path problem. 293-309 - John A. Buzacott:
A recursive algorithm for finding reliability measures related to the connection of nodes in a graph. 311-327 - Pitu B. Mirchandani, Aissa Oudjit:
Localizing 2-medians on probabilistic and deterministic tree networks. 329-350 - Richard D. Wollmer:
Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport. 351-362 - Jean-Claude Picard, H. Donald Ratliff:
A cut approach to a class of quadratic integer programming problems. 363-370
- Bruce L. Golden, Arjang A. Assad:
Location on networks: Theory and algorithms, Gabriel Handler and Pitu Mirchandani, MIT Press, Cambridge, 1979, 233 pp. Price: $20.00. 371-372
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 2025-11-11 02:12 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: