Journals in DBLP

Networks
1996, volume: 27, number: 2

1. Yves Nobert, Jean-Claude Picard
   An optimal algorithm for the mixed Chinese postman problem. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:97-108 [Journal]
   
2. Kalyan T. Talluri
   Network synthesis with few edges. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:109-115 [Journal]
   
3. Frieda Granot, Michal Penn, Maurice Queyranne
   Disconnecting sets in single and two-terminal-pair networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:117-123 [Journal]
   
4. L. Petingi, J. T. Saccoman, L. Schoppmann
   Uniformly least reliable graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:125-131 [Journal]
   
5. George H. Polychronopoulos, John N. Tsitsiklis
   Stochastic shortest path problems with recourse. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:133-143 [Journal]
   
6. Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung
   Transmitting on various network topologies. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:145-157 [Journal]
   
7. Ju-Young Lee Park, Hyeong-Ah Choi
   Circuit-switched row-column broadcasting in torus and mesh networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:2, pp:159-167 [Journal]