• 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 27 matches

• 1997
• 
  Christos Alexopoulos:
  State space partitioning methods for stochastic shortest path problems. Networks 30(1): 9-21 (1997)
• 
  Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan:
  De Bruijn and Kautz bus networks. Networks 30(3): 205-218 (1997)
• 
  Jean-Claude Bermond, Zhen Liu, Michel Syska:
  Mean eccentricities of de Bruijn networks. Networks 30(3): 187-203 (1997)
• 
  Gerard J. Chang, Frank K. Hwang:
  Optimality of consecutive and nested tree partitions. Networks 30(2): 75-80 (1997)
• 
  Jean-François Cordeau, Michel Gendreau, Gilbert Laporte:
  A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2): 105-119 (1997)
• 
  Yves Crama, Maarten Oosten:
  The polytope of block diagonal matrices and complete bipartite partitionings. Networks 30(4): 263-282 (1997)
• 
  David P. Day, Ortrud Oellermann, Henda C. Swart:
  A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997)
• 
  Feodor F. Dragan, Falk Nicolai:
  r-domination problems on homogeneously orderable graphs. Networks 30(2): 121-131 (1997)
• 
  Dyi-Rong Duh, Gen-Huey Chen:
  On the Rabin number problem. Networks 30(3): 219-230 (1997)
• 
  Kathryn Fraughnaugh:
  Introduction to graph theory. Networks 30(1): 73 (1997)
• 
  Bryan Gilbert, Wendy J. Myrvold:
  Maximizing spanning trees in almost complete graphs. Networks 30(1): 23-30 (1997)
• 
  Bryan Gilbert, Wendy J. Myrvold:
  Maximizing spanning trees in almost complete graphs. Networks 30(2): 97-104 (1997)
• 
  S. Louis Hakimi, Edward F. Schmeichel:
  Locating replicas of a database on a network. Networks 30(1): 31-36 (1997)
• 
  Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu:
  Exact reliabilities of most reliable double-loop networks. Networks 30(2): 81-90 (1997)
• 
  Khee Meng Koh, Eng Guan Tay:
  On optimal orientations of Cartesian products of even cycles and paths. Networks 30(1): 1-7 (1997)
• 
  Peter Che Bor Lam, Zhongfu Zhang:
  The vertex-face total chromatic number of Halin graphs. Networks 30(3): 167-170 (1997)
• 
  Serge Lawrencenko, Qiang Luo:
  Graphs with given connectivity properties. Networks 30(4): 255-261 (1997)
• 
  Sang Kyu Lee, Hyeong-Ah Choi:
  Link-disjoint embedding of complete binary trees in meshes. Networks 30(4): 283-292 (1997)
• 
  Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
  On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. Networks 30(1): 47-56 (1997)
• 
  Peh H. Ng, Ronald L. Rardin:
  Commodity family extended formulations of uncapacitated fixed charge network flow problems. Networks 30(1): 57-71 (1997)
• 
  José Rodríguez, Lorenzo Traldi:
  (K, j)-domination and (K, j)-reliability. Networks 30(4): 293-306 (1997)
• 
  Guifang Wang, Lianzhu Zhang:
  The structure of max lambda-min _m+1 graphs used in the design of reliable networks. Networks 30(4): 231-242 (1997)
• 
  Russ J. Vander Wiel, Nikolaos V. Sahinidis:
  The assignment problem with external interactions. Networks 30(3): 171-185 (1997)
• 
  Pawel Winter, Martin Zachariasen:
  Euclidean Steiner minimum trees: An improved exact algorithm. Networks 30(3): 149-166 (1997)
• 
  Guoliang Xue:
  Linear time algorithms for computing the most reliable source on an unreliable tree network. Networks 30(1): 37-45 (1997)
• 
  Bo Yu, Joseph Cheriyan:
  The node multiterminal cut polyhedron. Networks 30(2): 133-148 (1997)
• 
  Gengui Zhou, Mitsuo Gen:
  A note on genetic algorithms for degree-constrained spanning tree problems. Networks 30(2): 91-95 (1997)