Shortest paths with euclidean distances: An explanatory model.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 297, doi. 10.1002/net.3230080404
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1978 AND VI 8 AND IP 4
Results: 7
1
2
Link designs and probability analyses for a class of connecting networks.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 287, doi. 10.1002/net.3230080403
- By:
- Publication type:
- Article
3
The complexity of the network design problem.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 279, doi. 10.1002/net.3230080402
- By:
- Publication type:
- Article
4
Graphs as mathematical models by Gary Chartrand, Prindle, Weber & Schmidt, Inc. Boston, Massachusetts 1977, $15.50, 294 pages.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 373, doi. 10.1002/net.3230080407
- By:
- Publication type:
- Article
5
A new shortest path updating algorithm.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 341, doi. 10.1002/net.3230080406
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1978, v. 8, n. 4, p. fmi, doi. 10.1002/net.3230080401
- Publication type:
- Article
7
Primal simplex network codes: State-of-the-art implementation technology.
- Published in:
- Networks, 1978, v. 8, n. 4, p. 315, doi. 10.1002/net.3230080405
- By:
- Publication type:
- Article