The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1997, volume: 29, number: 3

  1. Yixun Lin
    Minimum bandwidth problem for embedding graphs in cycles. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:135-140 [Journal]
  2. X. Cai, Ton Kloks, C. K. Wong
    Time-varying shortest path problems with constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:141-150 [Journal]
  3. Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner
    Minimum-weight cycles in 3-separable graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:151-160 [Journal]
  4. Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman
    A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:161-171 [Journal]
  5. Mauricio G. C. Resende, Celso C. Ribeiro
    A GRASP for graph planarization. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:173-189 [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