- Arnon Rosenthal:
Series-parallel reduction for difficult measures of network reliability. Networks 11(4): 323-334 (1981) - Doron Rotem, Jorge Urrutia:
Finding maximum cliques in circle graphs. Networks 11(3): 269-278 (1981) - Doris R. Ryan, Stephen Chen:
A comparison of three algorithms for finding fundamental cycles in a directed graph. Networks 11(1): 1-12 (1981) - A. Satyanarayana, Jane N. Hagstrom:
Combinatorial properties of directed graphs useful in computing network reliability. Networks 11(4): 357-366 (1981) - Linus Schrage:
Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11(2): 229-232 (1981) - Peter J. Slater:
The k-nucleus of a graph. Networks 11(3): 233-242 (1981) - J. MacGregor Smith, D. T. Lee, Judith Liebman:
An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric. Networks 11(1): 23-39 (1981) - Howard A. Smolleck, Mo-Shing Chen:
A new approach to near-optimal path assignment through electric-circuit modeling. Networks 11(4): 335-349 (1981) - G. M. Weber:
Sensitivity analysis of optimal matchings. Networks 11(1): 41-56 (1981) - Norman Zadeh:
On the elimination of negative cost arcs in flow problems. Networks 11(4): 391-392 (1981)