Journals in DBLP

Networks
2001, volume: 37, number: 4

1. Dorit S. Hochbaum
   A new - old algorithm for minimum-cut and maximum-flow in closure graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:171-193 [Journal]
   
2. Christian Fremuth-Paeger, Dieter Jungnickel
   Balanced network flows. IV. Duality and structure theory. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:194-201 [Journal]
   
3. Christian Fremuth-Paeger, Dieter Jungnickel
   Balanced network flows. V. Cycle-canceling algorithms. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:202-209 [Journal]
   
4. Christian Fremuth-Paeger, Dieter Jungnickel
   Balanced network flows. VI. Polyhedral descriptions. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:210-218 [Journal]
   
5. Ashish Goel
   Stability of networks and protocols in the adversarial queueing model for packet routing. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:219-224 [Journal]
   
6. Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
   Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:4, pp:225-232 [Journal]