Volume 11; Issue 1

Networks

Volume 11; Issue 1
1

Masthead

Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 60 KB
english, 1981
2

A comparison of three algorithms for finding fundamental cycles in a directed graph

Doris R. Ryan, Stephen Chen
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 543 KB
english, 1981
3

On testing isomorphism of permutation graphs

Charles J. Colbourn
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 530 KB
english, 1981
4

An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric

J. Macgregor Smith, D. T. Lee, Judith S. Liebman
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 789 KB
english, 1981
5

Sensitivity analysis of optimal matchings

G. M. Weber
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 666 KB
english, 1981
6

Graphs as models of communication network vulnerability: Connectivity and persistence

Frank T. Boesch, Frank Harary, Jerald A. Kabell
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 338 KB
english, 1981
7

The cohesiveness of a point of a graph

Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 184 KB
english, 1981
8

Covering and packing in graphs IV: Linear arboricity

Jin Akiyama, Geoffrey Exoo, Frank Harary
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 192 KB
english, 1981
9

A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges

Joseph Henry Discenza
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 161 KB
english, 1981
10

The complexity of designing a network with minimum diameter

J. Plesnik
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 461 KB
english, 1981
11

Mean flow scheduling and optimal construction of a treelike communication network

Yehoshua Perl, Yaacov Yesha
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 322 KB
english, 1981