Found: 6
Select item for more details and to access through your institution.
The probabilistic minimum spanning tree problem.
- Published in:
- Networks, 1990, v. 20, n. 3, p. 245, doi. 10.1002/net.3230200302
- By:
- Publication type:
- Article
Combining monte carlo estimates and bounds for network reliability.
- Published in:
- Networks, 1990, v. 20, n. 3, p. 277, doi. 10.1002/net.3230200303
- By:
- Publication type:
- Article
A characterization of partial 3-trees.
- Published in:
- Networks, 1990, v. 20, n. 3, p. 299, doi. 10.1002/net.3230200304
- By:
- Publication type:
- Article
Fair dissections of spiders, worms, and caterpillars.
- Published in:
- Networks, 1990, v. 20, n. 3, p. 323, doi. 10.1002/net.3230200305
- By:
- Publication type:
- Article
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem.
- Published in:
- Networks, 1990, v. 20, n. 3, p. 345, doi. 10.1002/net.3230200306
- By:
- Publication type:
- Article
Masthead.
- Published in:
- Networks, 1990, v. 20, n. 3, p. fmi, doi. 10.1002/net.3230200301
- Publication type:
- Article