The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2001, volume: 37, number: 2

  1. Fred S. Roberts, Li Sheng
    How hard is it to determine if a graph has a 2-role assignment? [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:67-73 [Journal]
  2. Lou Caccetta, S. P. Hill
    A branch and cut method for the degree-constrained minimum spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:74-83 [Journal]
  3. Ray-Shang Lo, Gen-Huey Chen
    Embedding longest fault-free paths in arrangement graphs with faulty vertices. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:84-93 [Journal]
  4. Hovhannes A. Harutyunyan, Arthur L. Liestman
    Improved upper and lower bounds for k-broadcasting. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:94-101 [Journal]
  5. Shenggui Zhang, Ziguo Wang
    Scattering number in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:102-106 [Journal]
  6. Charles J. Colbourn, Peng-Jun Wan
    Minimizing drop cost for SONET/WDM networks with wavelength requirements. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:2, pp:107-116 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002