The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1996, volume: 27, number: 4

  1. Prakash Mirchandani
    A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:215-217 [Journal]
  2. Emanuel Melachrinoudis, Mary E. Helander
    A single facility location problem on a tree with unreliable edges. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:219-237 [Journal]
  3. Pierre Fraigniaud, Christian Laforest
    Minimum gossip bus networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:239-251 [Journal]
  4. A. Volgenant
    An addendum to the most vital edges of matching in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:253- [Journal]
  5. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
    A response to Volgenant's Addendum on the most vital edges. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:27, n:4, pp:255- [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