A note on bisecting minimum spanning trees.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 187, doi. 10.1002/net.3230080302
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1978 AND VI 8 AND IP 3
Results: 8
1
2
The complexity of the capacitated tree problem.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 217, doi. 10.1002/net.3230080306
- By:
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1978, v. 8, n. 3, p. fmi, doi. 10.1002/net.3230080301
- Publication type:
- Article
4
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 209, doi. 10.1002/net.3230080305
- By:
- Publication type:
- Article
5
A good algorithm for smallest spanning trees with a degree constraint.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 201, doi. 10.1002/net.3230080304
- By:
- Publication type:
- Article
6
Permutation layout.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 253, doi. 10.1002/net.3230080308
- By:
- Publication type:
- Article
7
Systematic searches for hypohamiltonian graphs.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 193, doi. 10.1002/net.3230080303
- By:
- Publication type:
- Article
8
A decomposition algorithm for network reliability analysis.
- Published in:
- Networks, 1978, v. 8, n. 3, p. 231, doi. 10.1002/net.3230080307
- By:
- Publication type:
- Article