On the online shortest path problem with limited arc cost dependencies.
- Published in:
- Networks, 2002, v. 40, n. 4, p. 216, doi. 10.1002/net.10049
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2002 AND VI 40 AND IP 4
Results: 6
1
2
Efficient algorithms for finding the ( k, l)-core of tree networks.
- Published in:
- Networks, 2002, v. 40, n. 4, p. 208, doi. 10.1002/net.10051
- By:
- Publication type:
- Article
3
Design of fault-tolerant networks for satellites (TWTA redundancy).
- Published in:
- Networks, 2002, v. 40, n. 4, p. 202, doi. 10.1002/net.10044
- By:
- Publication type:
- Article
4
Combinatorial algorithms for inverse network flow problems.
- Published in:
- Networks, 2002, v. 40, n. 4, p. 181, doi. 10.1002/net.10048
- By:
- Publication type:
- Article
5
Multistars and directed flow formulations.
- Published in:
- Networks, 2002, v. 40, n. 4, p. 188, doi. 10.1002/net.10050
- By:
- Publication type:
- Article
6
The fractional matching numbers of graphs.
- Published in:
- Networks, 2002, v. 40, n. 4, p. 228, doi. 10.1002/net.10047
- By:
- Publication type:
- Article