default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 6
Volume 6, Number 1, 1976
- A. C. Williams, R. A. Bhandiwad:
A generating function approach to queueing network analysis of multiprogrammed computers. 1-22 - Dennis P. Geller:
Coding graphs by contractions. 23-33 - Peter J. Slater, Seymour E. Goodman, Stephen T. Hedetniemi:
On the optional hamiltonian completion problem. 35-51 - J. Bruno, L. Weinberg:
Generalized networks: Networks embedded on a matroid, part I. 53-94
Volume 6, Number 2, 1976
- Delbert Ray Fulkerson, Gary C. Harding:
On edge-disjoint branchings. 97-104 - M. A. Hall:
Hydraulic network analysis using (generalized) geometric programming. 105-130 - K. R. Gehner:
A necessary condition for the existence of a circuit of any specified length. 131-138 - E. T. Dixon, Seymour E. Goodman:
An algorithm for the longest cycle problem. 139-149 - Klaus Truemper:
An efficient scaling procedure for gain networks. 151-159 - James R. Evans:
Maximum flow in probabilistic graphs-the discrete case. 161-183 - J. Randall Brown:
An Algorithm for r-Bases of a Directed Graph. 185-188
- Daniel P. Heyman:
QUEUEING SYSTEMS, VOLUME 1: THEORY by Leonard Kleinrock John Wiley & Sons, Inc., New York, 1975, $19.95, 417 pages. 189-190
Volume 6, Number 3, 1976
- Melvin Tainiter:
A new deterministic network reliability measure. 191-204 - Douglas R. Shier:
Iterative methods for determining the k shortest paths in a network. 205-229 - J. Bruno, L. Weinberg:
Generalized networks: Networks embedded on a matroid, part II. 231-272 - Jan Karel Lenstra, A. H. G. Rinnooy Kan:
On general routing problems. 273-280 - C. S. Orloff:
On general routing problems: Comments. 281-284
- Geraldine B. Wexelblat:
"Travels in Computerland, or Incompatibilities and Interfaces" by Ben Ross Schneider, Jr. Addison-Wesley Publishing Company Reading, Massachusetts 1974, $5.95, 256 pages. 285-286
Volume 6, Number 4, 1976
- R. E. Thomas:
On optimum path problems. 287-305 - Ahnont Wongseelashote:
An algebra for determining all path-values in a network with application to K-shortest-paths problems. 307-334 - C. G. Bird:
On cost allocation for a spanning tree: A game theoretic approach. 335-350 - D. H. Lee:
Low cost drainage networks. 351-371 - A. Tamir:
On totally unimodular matrices. 373-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 2025-01-24 17:11 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:
