All ( k; g)-cages are edge-superconnected.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 102, doi. 10.1002/net.20092
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2006 AND VI 47 AND IP 2
Results: 7
1
2
Black hole search in common interconnection networks.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 61, doi. 10.1002/net.20095
- By:
- Publication type:
- Article
3
The multiroute maximum flow problem revisited.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 81, doi. 10.1002/net.20099
- By:
- Publication type:
- Article
4
Fixed tree games with multilocated players.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 93, doi. 10.1002/net.20093
- By:
- Publication type:
- Article
5
Upgrading arcs to minimize the maximum travel time in a network.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 72, doi. 10.1002/net.20097
- By:
- Publication type:
- Article
6
Lower bounds for the relative greedy algorithm for approximating Steiner trees.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 111, doi. 10.1002/net.20100
- By:
- Publication type:
- Article
7
An integer programming approach to routing in daisy networks.
- Published in:
- Networks, 2006, v. 47, n. 2, p. 116, doi. 10.1002/net.20104
- By:
- Publication type:
- Article