default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 12
Volume 12, Number 1, Spring 1982
- Refael Hassin:
Minimum cost flow with set-constraints. 1-21 - Alan M. Frieze
, Giulia Galbiati, Francesco Maffioli:
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. 23-39 - Harrison E. Rowe, Wanda L. Mammel:
Counting formulas for tree growth plans. 41-56 - Stella Dafermos:
The general multimodal network equilibrium problem with elastic demand. 57-72 - Oded Berman, Amedeo R. Odoni:
Locating mobile servers on a network with markovian properties. 73-86
- John G. Klincewicz:
Algorithms for Network Programming, by J. L. Kennington and R. V. Helgason, Wiley, New York, 1980, 291 pp. Price: $25.00. 87-88
Volume 12, Number 2, Summer 1982
- Silvano Martello, Paolo Toth:
Finding a minimum equivalent graph of a digraph. 89-100 - Paul H. Zipkin:
Aggregation and disaggregation in convex network problems. 101-117 - Ove Frank, Wolfgang Gaul:
On reliability in stochastic graphs. 119-126 - Ranel E. Erickson:
Generalizations of planar graphs. 127-140 - Jean-Claude Picard, Maurice Queyranne:
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. 141-159 - John J. Jarvis, Süleyman Tüfekci:
A decomposition algorithm for locating a shortest path between two nodes in a network. 161-172 - M. Cutler, Z. Riesel:
Minimum width 2-layer layout of a multichanneled system. 173-189 - Yosef Sheffi, Warren B. Powell:
An algorithm for the equilibrium assignment problem with random link times. 191-207
Volume 12, Number 3
- Adrian Segall:
Decentralized maximum-flow protocols. 213-230 - C. L. Kwan, S. Toida:
An optimal 2-FT realization of binary symmetric hierarchical tree systems. 231-239 - J. E. Somers:
Maximum flow in networks with a small number of random arc capacities. 241-253 - Andrew W. Shogan:
Modular decomposition and reliability computation in stochastic transportation networks having cutnodes. 255-275 - Alon Itai, Yehoshua Perl, Yossi Shiloach:
The complexity of finding maximum disjoint paths with length constraints. 277-286 - Shuji Tsukiyama, Ernest S. Kuh:
Double-row planar routing and permutation layout. 287-316 - Frank Harary, Bernt Lindström, Hans-olov Zetterström:
On balance in group graphs. 317-321 - M. L. Shore, Leslie R. Foulds, Peter B. Gibbons:
An algorithm for the steiner problem in graphs. 323-333 - Chih-Kang Eric Chen, Robert S. Garfinkel:
The generalized diameter of a graph. 335-340 - Francis T. Boesch, Charles L. Suffel:
Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. 341-350
- Clyde L. Monma:
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95. 351 - Eric Rosenberg:
Optimization: Theory and applications, by S . S . Rao, Wiley Eastern Limited, New Delhi, 1979, 711 pp. Price: $21.95. 352-353
Volume 12, Number 4, Winter 1982
- Bezalel Gavish:
Topological design of centralized computer networks - formulations and algorithms. 355-377 - Katta G. Murty, Clovis Perin:
A 1-matching blossom-type algorithm for edge covering problems. 379-391 - Arthur M. Farley, Andrzej Proskurowski:
Networks immune to isolated line failures. 393-403 - Geoffrey Exoo:
On a measure of communication network vulnerability. 405-409 - Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An efficient algorithm for K shortest simple paths. 411-427 - Doron Rotem, Jorge Urrutia:
Circular permutation graphs. 429-437 - Eitan Zemel:
Polynomial algorithms for estimating network reliability. 439-452 - Alan C. Tucker, Armen H. Zemanian:
A matroid related to finitely chainlike, countably infinite networks. 453-457 - Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung:
Efficient algorithms for interval graphs and circular-arc graphs. 459-467 - Mokhtar S. Bazaraa, Hanif D. Sherali:
A property regarding degenerate pivots for linear assignment networks. 469-474 - Stephen R. Schmidt, Paul A. Jensen, J. Wesley Barnes:
An advanced dual incremental network algorithm. 475-492 - Horst W. Hamacher:
Determining minimal cuts with a minimal number of arcs. 493-504
- Ronald Kaufman:
Communications network analysis, by Howard Cravis, Lexington Books, Lexington, MA, 1981, 144pp. Price not given. 505 - Jack Yorkiewicz:
Optimality in nonlinear programming: A feasible directions approach, by A. Ben-Israel, A. Ben-Td, and S. Zlobec, Wiley, New York, 1981, 144 pp. Price: $21.95. 506-507 - Jerrold R. Griggs:
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95. 507-508 - Trond Steihaug:
Practical methods of optimization volume 1 : Unconstrained optimization, by R. Flet-cher, Wiley, New York, 1980, 120 pp. Price: $24.50. 508-509
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-12-19 22:13 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:
