default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 3
Volume 3, Number 1, 1973
- Norman Zadeh:
Construction of efficient tree networks: The pipeline problem. 1-31 - S. Chang, Nicholas DeClaris, R. W. Newcomb:
Synthesis of modulation insensitive N-path filters. 33-52 - Robert W. Rosenthal:
The network equilibrium problem in integers. 53-59 - Andrés Weintraub
:
The shortest and the K-shortest routes as assignment problems. 61-73 - J. Brody:
A probabilistic model of learning by means of problems. 75-80 - Aaron Kershenbaum, Richard M. Van Slyke:
Recursive analysis of network reliability. 81-94
- Francis T. Boesch:
Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages. 95-96
Volume 3, Number 2, 1973
- Luigi Fratta, Mario Gerla, Leonard Kleinrock:
The flow deviation method: An approach to store-and-forward communication network design. 97-133 - Marvin V. Zelkowitz, Ashok K. Agrawala:
KWIC Index for Computer Networks. 135-171 - K. Mani Chandy, Tachen Lo:
The Capacitated Minimum Spanning Tree. 173-181
- E. C. Gaines Jr., Janet M. Taplin:
Conference Report. 183-190
- Stephen Chen:
APPLIED GRAPH THEORY by Clifford W. Marshall, Wiley-Interscience, 1971. 191-192
Volume 3, Number 3, 1973
- Bernard Yaged Jr.:
Minimum cost routing for dynamic network models. 193-224 - D. L. Wang, Daniel J. Kleitman:
On the existence of N-connected graphs with prescribed degrees (n ≧ 2). 225-239 - S. Louis Hakimi, Ashok T. Amin:
On the design of reliable networks. 241-260 - Fanica Gavril:
Algorithms for a maximum clique and a maximum independent set of a circle graph. 261-273 - Eugene L. Lawler:
Cutsets and partitions of hypergraphs. 275-285 - J. D. Murchland:
Historical note on optimum spanning arborescences. 287-288
Volume 3, Number 4, 1973
- Armin Claus, Daniel J. Kleitman:
Cost allocation for a spanning tree. 289-304 - Arnold Barnett:
On operating a shuttle service. 305-313 - Norman Zadeh:
On building minimum cost communication networks. 315-331 - Said Ashour, K. Y. Chiu, T. E. Moore:
An optimal schedule time of a job shop-like disjunctive graph. 333-349 - Frederic G. Commoner:
A sufficient condition for a matrix to be totally unimodular. 351-365 - J. Randall Brown:
The chromatic reduction problem. 367-377 - Charles R. Baugh:
Seventh annual ieee computer society international conference. 379-380 - W. L. Price:
Graphs and networks - an introduction by W. L. Price, Auerbach Publishers Inc., 1971. 381-382
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 2026-09-02 23:18 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
