Journals in DBLP

Networks
1996, volume: 28, number: 3

1. Kenneth A. Berman
   Vulnerability of scheduled networks and a generalization of Menger's Theorem. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:28, n:3, pp:125-134 [Journal]
   
2. James A. Knisely, Renu Laskar
   Cyclic gossiping times for some classes of graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:28, n:3, pp:135-141 [Journal]
   
3. Andrzej Pelc
   Fault-tolerant broadcasting and gossiping in communication networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:28, n:3, pp:143-156 [Journal]
   
4. Mokhtar Aboelaze
   MLH: A hierarchical hypercube network. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:28, n:3, pp:157-165 [Journal]
   
5. Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward
   On the location of a tree-shaped facility. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:28, n:3, pp:167-175 [Journal]