Found: 6
Select item for more details and to access through your institution.
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 171, doi. 10.1002/net.1012
- By:
- Publication type:
- Article
Balanced network flows. IV. Duality and structure theory.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 194, doi. 10.1002/net.1013
- By:
- Publication type:
- Article
Balanced network flows. V. Cycle-canceling algorithms.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 202, doi. 10.1002/net.1014
- By:
- Publication type:
- Article
Balanced network flows. VI. Polyhedral descriptions.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 210, doi. 10.1002/net.1015
- By:
- Publication type:
- Article
Stability of networks and protocols in the adversarial queueing model for packet routing.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 219, doi. 10.1002/net.1016
- By:
- Publication type:
- Article
Characterization results of all shortest paths interval routing schemes.
- Published in:
- Networks, 2001, v. 37, n. 4, p. 225, doi. 10.1002/net.1017
- By:
- Publication type:
- Article