Journals in DBLP

Networks
1999, volume: 34, number: 3

1. Robert S. Garfinkel, Ian R. Webb
   On crossings, the Crossing Postman Problem, and the Rural Postman Problem. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:173-180 [Journal]
   
2. Cees Duin, Stefan Voß
   The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:181-191 [Journal]
   
3. Sheshayya A. Choudum, N. Priya
   Tenacity of complete graph products and grids. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:192-196 [Journal]
   
4. Angeles Carmona, Josep Fàbrega
   On the superconnectivity and the conditional diameter of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:197-205 [Journal]
   
5. Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
   Optimal adaptive fault diagnosis for simple multiprocessor systems. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:206-214 [Journal]
   
6. Robert F. Easley, David Hartvigsen
   Crossing properties of multiterminal cuts. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:215-220 [Journal]
   
7. Masafumi Yamashita, Tsunehiko Kameda
   Modeling K-coteries by well-covered graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:221-228 [Journal]
   
8. Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer
   Heuristic and exact algorithms for scheduling aircraft landings. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:34, n:3, pp:229-241 [Journal]