Volume 37; Issue 4

Networks

Volume 37; Issue 4
1

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

Dorit S. Hochbaum
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 307 KB
english, 2001
2

Balanced network flows. IV. Duality and structure theory

Christian Fremuth-Paeger, Dieter Jungnickel
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 125 KB
english, 2001
3

Balanced network flows. V. Cycle-canceling algorithms

Christian Fremuth-Paeger, Dieter Jungnickel
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 161 KB
english, 2001
4

Balanced network flows. VI. Polyhedral descriptions

Christian Fremuth-Paeger, Dieter Jungnickel
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 131 KB
english, 2001
5

Stability of networks and protocols in the adversarial queueing model for packet routing

Ashish Goel
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 92 KB
english, 2001
6

Characterization results of all shortest paths interval routing schemes

M. Flammini, G. Gambosi, U. Nanni, R.B. Tan
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 119 KB
english, 2001