Journals in DBLP

Networks
2003, volume: 42, number: 3

1. Francesc Comellas, Pavol Hell
   Broadcasting in generalized chordal rings. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:123-134 [Journal]
   
2. I. Dumitrescu, N. Boland
   Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:135-153 [Journal]
   
3. Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
   Reoptimizing the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:154-159 [Journal]
   
4. Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
   A linear algorithm for compact box-drawings of trees. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:160-164 [Journal]
   
5. Steven B. Horton, T. Easton, R. Gary Parker
   The linear arrangement problem on recursively constructed graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:165-168 [Journal]
   
6. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
   Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:42, n:3, pp:169-180 [Journal]