The capacitated arc routing problem with intermediate facilities.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 134, doi. 10.1002/net.3
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2001 AND VI 37 AND IP 3
Results: 6
1
2
On the number of spanning trees in directed circulant graphs.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 129, doi. 10.1002/net.2
- By:
- Publication type:
- Article
3
On the construction of combined k-fault-tolerant Hamiltonian graphs.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 165, doi. 10.1002/net.6
- By:
- Publication type:
- Article
4
Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 117, doi. 10.1002/net.1
- By:
- Publication type:
- Article
5
Minimum spanners of butterfly graphs.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 156, doi. 10.1002/net.5
- By:
- Publication type:
- Article
6
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 144, doi. 10.1002/net.4
- By:
- Publication type:
- Article