The k best spanning arborescences of a network.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 91, doi. 10.1002/net.3230100202
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1980 AND VI 10 AND IP 2
Results: 8
1
2
Complexity of network reliability computations.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 153, doi. 10.1002/net.3230100206
- By:
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1980, v. 10, n. 2, p. fmi, doi. 10.1002/net.3230100201
- Publication type:
- Article
4
An algorithm to solve the m × n assignment problem in expected time O( mn log n).
- Published in:
- Networks, 1980, v. 10, n. 2, p. 143, doi. 10.1002/net.3230100205
- By:
- Publication type:
- Article
5
Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 129, doi. 10.1002/net.3230100204
- By:
- Publication type:
- Article
6
Some comments on permutation layout.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 179, doi. 10.1002/net.3230100208
- By:
- Publication type:
- Article
7
A probabilistic model for the analysis of the routing process for circuits.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 111, doi. 10.1002/net.3230100203
- By:
- Publication type:
- Article
8
An integer linear programming approach to the steiner problem in graphs.
- Published in:
- Networks, 1980, v. 10, n. 2, p. 167, doi. 10.1002/net.3230100207
- By:
- Publication type:
- Article