Solving minimum K-cardinality cut problems in planar graphs.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 195, doi. 10.1002/net.20129
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2006 AND VI 48 AND IP 4
Results: 6
1
2
The shortest path problem on large-scale real-road networks.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 182, doi. 10.1002/net.20131
- By:
- Publication type:
- Article
3
On the spanning w-wide diameter of the star graph.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 235, doi. 10.1002/net.20135
- By:
- Publication type:
- Article
4
An improved deniable authentication protocol.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 179, doi. 10.1002/net.20130
- By:
- Publication type:
- Article
5
Extreme point characterizations for infinite network flow problems.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 209, doi. 10.1002/net.20134
- By:
- Publication type:
- Article
6
Efficiency and fairness of system-optimal routing with user constraints.
- Published in:
- Networks, 2006, v. 48, n. 4, p. 223, doi. 10.1002/net.20133
- By:
- Publication type:
- Article