
Journals in DBLP
Networks 1997, volume: 29, number: 4
 Dilip Chhajed
Edge coloring a ktree into two smaller trees. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:4, pp:191194 [Journal]
 DeRon Liang, RongHong Jan, Satish K. Tripathi
Reliability analysis of replicated andor graphs. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:4, pp:195203 [Journal]
 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:205216 [Journal]
 Daniel Gagliardi, Marty Lewinter
An infinite class of reachpreservable graphs. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:4, pp:217218 [Journal]
 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:219223 [Journal]
 ShinYeu Lin, Ch'iHsin Lin
A computationally efficient method for nonlinear multicommodity network flow problems. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:4, pp:225244 [Journal]
 Takao Asano
Constructing a bipartite graph of maximum connectivity with prescribed degrees. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:29, n:4, pp:245263 [Journal]
