Minimum cost routing for dynamic network models.
- Published in:
- Networks, 1973, v. 3, n. 3, p. 193, doi. 10.1002/net.3230030302
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1973 AND VI 3 AND IP 3
Results: 7
1
2
Cutsets and partitions of hypergraphs.
- Published in:
- Networks, 1973, v. 3, n. 3, p. 275, doi. 10.1002/net.3230030306
- By:
- Publication type:
- Article
3
Masthead.
- Published in:
- Networks, 1973, v. 3, n. 3, p. fmi, doi. 10.1002/net.3230030301
- Publication type:
- Article
4
Algorithms for a maximum clique and a maximum independent set of a circle graph.
- Published in:
- Networks, 1973, v. 3, n. 3, p. 261, doi. 10.1002/net.3230030305
- By:
- Publication type:
- Article
5
On the design of reliable networks.
- Published in:
- Networks, 1973, v. 3, n. 3, p. 241, doi. 10.1002/net.3230030304
- By:
- Publication type:
- Article
6
On the existence of N-connected graphs with prescribed degrees (n ≧ 2).
- Published in:
- Networks, 1973, v. 3, n. 3, p. 225, doi. 10.1002/net.3230030303
- By:
- Publication type:
- Article
7
Historical note on optimum spanning arborescences.
- Published in:
- Networks, 1973, v. 3, n. 3, p. 287, doi. 10.1002/net.3230030307
- By:
- Publication type:
- Article