Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 8
Volume 8, Number 1, Spring 1978
- Tvan T. Frisch:
Editorial. i-ii - Frank Boesch:
Editorial. iii
- Nimrod Megiddo:
Cost allocation for steiner trees. 1-6 - Dominique de Werra:
Color-feasible sequences of a multigraph. 7-16 - Klaus Truemper:
Optimal flows in nonlinear gain networks. 17-36 - Arjang A. Assad:
Multicommodity network flows - A survey. 37-91
Volume 8, Number 2, Summer 1978
- Francis T. Boesch, Frank Harary:
Unicyclic realizability of a degree list. 93-96 - W. David Kelton, Averill M. Law:
A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths. 97-106 - James R. Evans, John J. Jarvis:
Network topology and integral multicommodity flow problems. 107-119 - Fanica Gavril:
A recognition algorithm for the total graphs. 121-133 - Bruce H. Barnes, K. E. Mackey:
A generalized measure of independence and the strong product of graphs. 135-151 - R. F. Farmer, I. Kaufman:
On the numerical evaluation of some basic traffic formulae. 153-186
Volume 8, Number 3
- William M. Boyce, M. R. Garey, David S. Johnson:
A note on bisecting minimum spanning trees. 187-192 - J. B. Collier, Edward F. Schmeichel:
Systematic searches for hypohamiltonian graphs. 193-200 - Harold N. Gabow:
A good algorithm for smallest spanning trees with a degree constraint. 201-208 - Frank Harary, Allen J. Schwenk:
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks. 209-216 - Christos H. Papadimitriou:
The complexity of the capacitated tree problem. 217-230 - Andrew W. Shogan:
A decomposition algorithm for network reliability analysis. 231-251 - M. Cutler, Yossi Shiloach:
Permutation layout. 253-278
Volume 8, Number 4, Winter 1978
- David S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
The complexity of the network design problem. 279-285 - Frank K. Hwang:
Link designs and probability analyses for a class of connecting networks. 287-296 - Bruce L. Golden, Michael O. Ball:
Shortest paths with euclidean distances: An explanatory model. 297-314 - Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Primal simplex network codes: State-of-the-art implementation technology. 315-339 - S. Goto, Alberto L. Sangiovanni-Vincentelli:
A new shortest path updating algorithm. 341-372
- Bruce L. Golden:
Graphs as mathematical models by Gary Chartrand, Prindle, Weber & Schmidt, Inc. Boston, Massachusetts 1977, $15.50, 294 pages. 373-374
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-19 19:19 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:
