Found: 9
Select item for more details and to access through your institution.
A degree sequence problem related to network design.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 195, doi. 10.1002/net.3230240402
- By:
- Publication type:
- Article
Measures of vulnerability-the integrity family.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 207, doi. 10.1002/net.3230240403
- By:
- Publication type:
- Article
A delaunay triangulation-based heuristic for the euclidean steiner problem.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 215, doi. 10.1002/net.3230240404
- By:
- Publication type:
- Article
On super i-connected graphs.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 225, doi. 10.1002/net.3230240405
- By:
- Publication type:
- Article
Spanners in graphs of bounded degree.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 233, doi. 10.1002/net.3230240406
- By:
- Publication type:
- Article
On reliability of graphs with node failures.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 251, doi. 10.1002/net.3230240407
- By:
- Publication type:
- Article
Note: The diameter of edge domination critical graphs.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 261, doi. 10.1002/net.3230240408
- By:
- Publication type:
- Article
Note: Small integral flows need only sparse networks.
- Published in:
- Networks, 1994, v. 24, n. 4, p. 263, doi. 10.1002/net.3230240409
- By:
- Publication type:
- Article
Masthead.
- Published in:
- Networks, 1994, v. 24, n. 4, p. fmi, doi. 10.1002/net.3230240401
- Publication type:
- Article