default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 4
Volume 4, Number 1, 1974
- Armin Claus, Daniel J. Kleitman:
Cost allocation in networks: The bulk supplier problem. 1-17 - Norman Zadeh:
On building minimum cost communication networks over time. 19-34 - C. S. Orloff:
A fundamental problem in vehicle routing. 35-64 - E. J. Beltrami, Lawrence D. Bodin:
Networks and vehicle routing for municipal waste collection. 65-94
Volume 4, Number 2, 1974
- Eberhard Hänsler, Gerald K. McAuliffe, Robert S. Wilkov:
Exact calculation of computer network reliability. 95-112 - Denos C. Gazis:
Modeling and optimal control of congested transportation systems. 113-124 - J. W. Suurballe:
Disjoint paths in a network. 125-145 - C. S. Orloff:
Routing a fleet of M vehicles to/from a central facility. 147-162 - Frank Harary, Geert C. E. Prins:
Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph. 163-173 - Branko Grünbaum:
Matchings in polytopal graphs. 175-190
Volume 4, Number 3, 1974
- Fred W. Glover, David Karney, Darwin Klingman:
Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems. 191-212 - Howard Frank, Wushow Chou:
Network properties of the ARPA computer network. 213-239 - Jonathan Halpern, I. Priess:
Shortest path with time constraints on movement and parking. 241-253 - Edward Minieka:
Dynamic network flows with arc changes. 255-265 - E. Kant:
A multicommodity flow problem. 267-280 - Dennis P. Geller, Anthony J. W. Hilton:
How to colour the lines of a bigraph. 281-282
- M. R. Wohlers:
Network analysis and synthesis. by B. D. O. Anderson and S. Vongpanitlerd Prentice-Hall, Inc., Englewood Cliffs, N. J. 1973, 548 pages, $17.95. 283-285
Volume 4, Number 4, 1974
- L. J. Mauceri:
Control of an expanding network - "An operational nightmare". 287-297 - Aaron Kershenbaum:
Computing capacitated minimal spanning trees efficiently. 299-310 - J. Randall Brown:
Shortest alternating path algorithms. 311-334 - Vinton G. Cerf, Donald D. Cowan
, Ronald C. Mullin, R. G. Stanton:
A lower bound on the average shortest path length in regular graphs. 335-342 - Robert W. Klessig:
An algorithm for nonlinear multicommodity flow problems. 343-355 - Fanica Gavril:
Algorithms on circular-arc graphs. 357-369 - Frank Harary, Abraham Lempel:
On clique-extremal (p, q)-graphs. 371-378
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-05-19 22:24 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:
