• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

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