Journals in DBLP

Networks
1999, volume: 33, number: 3

1. Weizhen Gu
   On diameter of permutation graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:161-166 [Journal]
   
2. Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis
   Transmissions in a network with capacities and delays. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:167-174 [Journal]
   
3. Dan Trietsch, J. F. Weng
   Pseudo-Gilbert-Steiner trees. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:175-178 [Journal]
   
4. Bruno Beauquier
   All-to-all communication for some wavelength-routed all-optical networks. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:179-187 [Journal]
   
5. Bettina Klinz, Gerhard J. Woeginger
   A note on the bottleneck graph partition problem. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:189-191 [Journal]
   
6. Enrique Castillo, Ali S. Hadi, F. Jubete, Cristina Solares
   An expert system for coherent assessment of probabilities in multigraph models. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:193-206 [Journal]
   
7. Cécile Murat, Vangelis Th. Paschos
   The probabilistic longest path problem. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:207-219 [Journal]
   
8. Yu-Chee Tseng, Yuh-Shyan Chen, Tong-Ying Juang, Chiou-Jyu Chang
   Congestion-free, dilation-2 embedding of complete binary trees into star graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:221-231 [Journal]
   
9. Hajo Broersma, Erik Engbers, Huib Trommel
   Various results on the toughness of graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1999, v:33, n:3, pp:233-238 [Journal]
   
10. Ashish Tripathy, Haldun Süral, Yigal Gerchak
    Multidimensional assortment problem with an application. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:239-245 [Journal]