The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1997, volume: 29, number: 4

  1. Dilip Chhajed
    Edge coloring a k-tree into two smaller trees. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:191-194 [Journal]
  2. De-Ron Liang, Rong-Hong Jan, Satish K. Tripathi
    Reliability analysis of replicated and-or graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:195-203 [Journal]
  3. Esther M. Arkin, Refael Hassin, Limor Klein
    Restricted delivery problems on a network. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:205-216 [Journal]
  4. Daniel Gagliardi, Marty Lewinter
    An infinite class of reach-preservable graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:217-218 [Journal]
  5. Shimon Even, Ami Litman
    Layered cross product - A technique to construct interconnection networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:219-223 [Journal]
  6. Shin-Yeu Lin, Ch'i-Hsin Lin
    A computationally efficient method for nonlinear multicommodity network flow problems. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:225-244 [Journal]
  7. Takao Asano
    Constructing a bipartite graph of maximum connectivity with prescribed degrees. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:245-263 [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