Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 5
Volume 5, Number 4, October 1975
- Arnon Rosenthal:
A bit-pushing shortest distance algorithm. 301-305 - R. D. Barnard:
Optimal-aim regulation and tracking in large-order nonlinear networks. 307-329 - Bruce L. Golden:
A minimum-cost multicommodity network flow problem concerning imports and exports. 331-356 - Jean-Claude Picard, H. Donald Ratliff:
Minimum cuts and related problems. 357-370 - R. L. Tobin:
Minimal complete matchings and negative cycles. 371-387 - S. Louis Hakimi:
The Program, Conclusions and Recommendations. 1-6 - Howard Frank:
Computer Networks: Art to Science to Art. 7-32 - S. Lin:
Heuristic Programming as an Aid to Network Design. 33-43 - Richard M. Karp:
On the Computational Complexity of Combinatorial Problems. 45-68 - H. Frank:
Computer Networks. 69-73 - Denos C. Gazis:
Transportation Networks. 75-79 - Hermann W. Dommel:
Energy Networks. 81-84 - Maurice Hanan:
Layout, Interconnection, and Placement. 85-88 - Eugene L. Lawler:
Algorithms, Graphs, and Complexity. 89-92 - L. S. Lasdon:
Partitions, Decomposition, Sparsity. 93-96 - Richard M. Van Slyke:
Stochastic Aspects of Networks. 97-100 - P. Weiner:
Heuristics. 101-103
Volume 5, Number 2, April 1975
- I. Paz:
On the Traffic Handling Capability of Communication Networks Homogeneously Loaded. 109-128 - A. R. Pierce:
Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956-1974). 129-149 - Luigi Fratta, Ugo Montanari:
A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph. 151-177 - L. Weinberg:
Duality in Networks: Roses, Bouquets, and Cut-Sets; Trees, Forests and Polygons. 179-201
- TRAFFIC SCIENCE. 203-204
Volume 5, Number 3, July 1975
- Izhak Rubin:
Multiterminal Path Flows for Packet-Switching Communication Networks. 205-236 - Ronald C. Read, Robert E. Tarjan:
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. 237-252 - Robert E. Bixby:
The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds. 253-298
- N. Deo:
Graph Theory with Applications to Engineering and Computer Science. 299-300
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-25 04:48 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:
