Found: 9
Select item for more details and to access through your institution.
Bounding all-terminal reliability in computer networks.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 1, doi. 10.1002/net.3230180102
- By:
- Publication type:
- Article
Probabilistic analysis of the longest hamiltonian tour problem.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 13, doi. 10.1002/net.3230180103
- By:
- Publication type:
- Article
Minimum augmentation of a tree to a K-edge-connected graph.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 19, doi. 10.1002/net.3230180104
- By:
- Publication type:
- Article
Generalized de Bruijn digraphs.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 27, doi. 10.1002/net.3230180105
- By:
- Publication type:
- Article
The minimax multistop location problem on a tree.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 39, doi. 10.1002/net.3230180106
- By:
- Publication type:
- Article
On a property of cyclic covers of p-graphs.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 51, doi. 10.1002/net.3230180107
- By:
- Publication type:
- Article
Convexity and the Steiner tree problem.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 55, doi. 10.1002/net.3230180108
- By:
- Publication type:
- Article
On a function for the vulnerability of a directed flow network.
- Published in:
- Networks, 1988, v. 18, n. 1, p. 73, doi. 10.1002/net.3230180109
- By:
- Publication type:
- Article
Masthead.
- Published in:
- Networks, 1988, v. 18, n. 1, p. fmi, doi. 10.1002/net.3230180101
- Publication type:
- Article