Minimal spanning trees in undirected networks with exponentially distributed arc weights.
- Published in:
- Networks, 1988, v. 18, n. 2, p. 111, doi. 10.1002/net.3230180204
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1988 AND VI 18 AND IP 2
Results: 6
1
2
A network flow algorithm to find an elementary I/O matching.
- Published in:
- Networks, 1988, v. 18, n. 2, p. 105, doi. 10.1002/net.3230180203
- By:
- Publication type:
- Article
3
A single-server priority queueing-location model.
- Published in:
- Networks, 1988, v. 18, n. 2, p. 87, doi. 10.1002/net.3230180202
- By:
- Publication type:
- Article
4
Computational complexity of PERT problems.
- Published in:
- Networks, 1988, v. 18, n. 2, p. 139, doi. 10.1002/net.3230180206
- By:
- Publication type:
- Article
5
Masthead.
- Published in:
- Networks, 1988, v. 18, n. 2, p. fmi, doi. 10.1002/net.3230180201
- Publication type:
- Article
6
Generalizations of broadcasting and gossiping.
- Published in:
- Networks, 1988, v. 18, n. 2, p. 125, doi. 10.1002/net.3230180205
- By:
- Publication type:
- Article