Masthead.
- Published in:
- Networks, 1992, v. 22, n. 7, p. fmi, doi. 10.1002/net.3230220701
- Publication type:
- Article
Works matching IS 00283045 AND DT 1992 AND VI 22 AND IP 7
Results: 7
1
2
Level graphs and approximate shortest path algorithms.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 691, doi. 10.1002/net.3230220707
- By:
- Publication type:
- Article
3
Counting k-component forests of a graph.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 647, doi. 10.1002/net.3230220704
- By:
- Publication type:
- Article
4
A message-routing strategy for multicomputer systems.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 627, doi. 10.1002/net.3230220703
- By:
- Publication type:
- Article
5
Networks communicating for each pairing of terminals.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 615, doi. 10.1002/net.3230220702
- By:
- Publication type:
- Article
6
Finding disjoint paths with different path-costs: Complexity and algorithms.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 653, doi. 10.1002/net.3230220705
- By:
- Publication type:
- Article
7
The Capacitated Arc Routing Problem: Lower bounds.
- Published in:
- Networks, 1992, v. 22, n. 7, p. 669, doi. 10.1002/net.3230220706
- By:
- Publication type:
- Article