The SCEAS System
Navigation Menu

Journals in DBLP

Networks
2001, volume: 38, number: 1

  1. Frank K. Hwang, Chih-Hung Yen
    Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:1-5 [Journal]
  2. Shiwoo Lee, Jose A. Ventura
    An algorithm for constructing minimal c-broadcast networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:6-21 [Journal]
  3. Gianluca Dini
    Electronic voting in a large-scale distributed system. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:22-32 [Journal]
  4. Gary Chartrand, Karen S. Novotny, Steven J. Winters
    The ultracenter and central fringe of a graph. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:33-38 [Journal]
  5. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient communication in unknown networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:39-49 [Journal]
  6. S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro
    Local search with perturbations for the prize-collecting Steiner tree problem in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:50-58 [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