
Journals in DBLP
Networks 2001, volume: 37, number: 2
 Fred S. Roberts, Li Sheng
How hard is it to determine if a graph has a 2role assignment? [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:6773 [Journal]
 Lou Caccetta, S. P. Hill
A branch and cut method for the degreeconstrained minimum spanning tree problem. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:7483 [Journal]
 RayShang Lo, GenHuey Chen
Embedding longest faultfree paths in arrangement graphs with faulty vertices. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:8493 [Journal]
 Hovhannes A. Harutyunyan, Arthur L. Liestman
Improved upper and lower bounds for kbroadcasting. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:94101 [Journal]
 Shenggui Zhang, Ziguo Wang
Scattering number in graphs. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:102106 [Journal]
 Charles J. Colbourn, PengJun Wan
Minimizing drop cost for SONET/WDM networks with wavelength requirements. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:107116 [Journal]
