Found: 8
Select item for more details and to access through your institution.
Control of an expanding network-'An operational nightmare'.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 287, doi. 10.1002/net.3230040402
- By:
- Publication type:
- Article
Computing capacitated minimal spanning trees efficiently.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 299, doi. 10.1002/net.3230040403
- By:
- Publication type:
- Article
Shortest alternating path algorithms.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 311, doi. 10.1002/net.3230040404
- By:
- Publication type:
- Article
A lower bound on the average shortest path length in regular graphs.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 335, doi. 10.1002/net.3230040405
- By:
- Publication type:
- Article
An algorithm for nonlinear multicommodity flow problems.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 343, doi. 10.1002/net.3230040406
- By:
- Publication type:
- Article
Algorithms on circular-arc graphs.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 357, doi. 10.1002/net.3230040407
- By:
- Publication type:
- Article
On clique-extremal (p,q)-graphs.
- Published in:
- Networks, 1974, v. 4, n. 4, p. 371, doi. 10.1002/net.3230040408
- By:
- Publication type:
- Article
Masthead.
- Published in:
- Networks, 1974, v. 4, n. 4, p. fmi, doi. 10.1002/net.3230040401
- Publication type:
- Article