Journals in DBLP

Networks
1996, volume: 27, number: 3

1. R. Sritharan
   A linear time algorithm to recognize circular permutation graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:3, pp:171-174 [Journal]
   
2. Mauro Dell'Amico, Martine Labbé, Francesco Maffioli
   Complexity of spanning tree problems with leaf-dependent objectives. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:3, pp:175-181 [Journal]
   
3. Krzysztof Diks, Andrzej Pelc
   Broadcasting with universal lists. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:3, pp:183-196 [Journal]
   
4. Georg Gunther, Bert Hartnell, Douglas F. Rall
   Star-factors and k-bounded total domination. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:3, pp:197-201 [Journal]
   
5. Hung-Kuei Ku, John P. Hayes
   Optimally edge fault-tolerant trees. [Citation Graph (0, 0)][DBLP]
   Networks, 1996, v:27, n:3, pp:203-214 [Journal]