The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1997, volume: 29, number: 1

  1. Amotz Bar-Noy, Shlomo Kipnis
    Multiple message broadcasting in the postal model. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:1-10 [Journal]
  2. Ariel Orda, Raphael Rom
    Optimal packet fragmentation and routing in computer networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:11-28 [Journal]
  3. Ramesh S. Sankaranarayana
    Tracking the P-NP boundary for well-covered graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:29-37 [Journal]
  4. Toru Hasunuma, Yukio Shibata
    Counting small cycles in generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:39-47 [Journal]
  5. Savio S. H. Tse, Francis C. M. Lau
    A lower bound for interval routing in general networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:49-53 [Journal]
  6. Matteo Fischetti, Daniele Vigo
    A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:55-67 [Journal]
  7. Konstantinos Kalpakis, Yaacov Yesha
    On the bisection width of the transposition network. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:69-76 [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