The node-weighted steiner tree problem.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 1, doi. 10.1002/net.3230170102
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1987 AND VI 17 AND IP 1
Results: 9
1
2
Addendum.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 63, doi. 10.1002/net.3230170106
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1987, v. 17, n. 1, p. fmi, doi. 10.1002/net.3230170101
- Publication type:
- Article
4
Domination and location in acyclic graphs.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 55, doi. 10.1002/net.3230170105
- By:
- Publication type:
- Article
5
Forbidden subgraphs and graph decomposition.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 105, doi. 10.1002/net.3230170109
- By:
- Publication type:
- Article
6
Linear arboricity of digraphs.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 39, doi. 10.1002/net.3230170104
- By:
- Publication type:
- Article
7
Investing in arcs in a network to maximize the expected max flow.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 87, doi. 10.1002/net.3230170108
- By:
- Publication type:
- Article
8
Graph folding and programmable logic array.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 19, doi. 10.1002/net.3230170103
- By:
- Publication type:
- Article
9
Problem reduction methods and a tree generation algorithm for the steiner network problem.
- Published in:
- Networks, 1987, v. 17, n. 1, p. 65, doi. 10.1002/net.3230170107
- By:
- Publication type:
- Article