Volume 11; Issue 3

Networks

Volume 11; Issue 3
1

Masthead

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

The k-nucleus of a graph

Peter J. Slater
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 467 KB
english, 1981
3

Generalizations of Hoffman's existence theorem for circulations

Refael Hassin
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 503 KB
english, 1981
4

Networks immune to isolated failures

Arthur M. Farley
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 765 KB
english, 1981
5

Finding maximum cliques in circle graphs

D. Rotem, J. Urrutia
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 505 KB
english, 1981
6

A new concept of primeness in graphs

R. H. Lamprey, B. H. Barnes
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 313 KB
english, 1981
7

Finding minimum rectilinear distance paths in the presence of barriers

Richard C. Larson, Victor O. K. Li
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 883 KB
english, 1981
8

Capacitated arc routing problems

Bruce L. Golden, Richard T. Wong
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 604 KB
english, 1981
9

A note on the problem of updating shortest paths

Satoru Fujishige
Journal:
Networks
Year:
1981
Language:
english
File:
PDF, 161 KB
english, 1981