New dynamic programming algorithms for the resource constrained elementary shortest path problem.
- Published in:
- Networks, 2008, v. 51, n. 3, p. 155, doi. 10.1002/net.20212
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2008 AND VI 51 AND IP 3
Results: 5
1
2
The fractional congestion bound for efficient edge disjoint routing.
- Published in:
- Networks, 2008, v. 51, n. 3, p. 190, doi. 10.1002/net.20216
- By:
- Publication type:
- Article
3
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases.
- Published in:
- Networks, 2008, v. 51, n. 3, p. 178, doi. 10.1002/net.20214
- By:
- Publication type:
- Article
4
w-Rabin numbers and strong w-Rabin numbers of folded hypercubes.
- Published in:
- Networks, 2008, v. 51, n. 3, p. 171, doi. 10.1002/net.20213
- By:
- Publication type:
- Article
5
Sufficient conditions for a graph to be super restricted edge-connected.
- Published in:
- Networks, 2008, v. 51, n. 3, p. 200, doi. 10.1002/net.20217
- By:
- Publication type:
- Article