On the cycle polytope of a directed graph and its relaxations.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 47, doi. 10.1002/net.20304
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2009 AND VI 54 AND IP 1
Results: 6
1
2
Approximability of unsplittable shortest path routing problems.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 23, doi. 10.1002/net.20303
- By:
- Publication type:
- Article
3
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 56, doi. 10.1002/net.20307
- By:
- Publication type:
- Article
4
A note on the k-degree Cayley graph.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 20, doi. 10.1002/net.20302
- By:
- Publication type:
- Article
5
Panconnectivity and edge-pancyclicity of k-ary n-cubes.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 1, doi. 10.1002/net.20290
- By:
- Publication type:
- Article
6
On the complexity of distributed graph coloring with local minimality constraints.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 12, doi. 10.1002/net.20293
- By:
- Publication type:
- Article