The SCEAS System
Navigation Menu

Journals in DBLP

Networks
1998, volume: 31, number: 4

  1. Dong X. Shaw, Geon Cho
    The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:205-216 [Journal]
  2. D. Gross, J. T. Saccoman
    Uniformly optimally reliable graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:217-225 [Journal]
  3. Philippe Mahey, Adam Ouorou, Larry LeBlanc, Jerome Chifflet
    A new proximal decomposition algorithm for routing in telecommunication networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:227-238 [Journal]
  4. Dominique Barth, Petrisor Panaite
    Undirected graphs rearrangeable by 2-length walks. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:239-247 [Journal]
  5. Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan
    Solving the all-pair shortest path query problem on interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:249-258 [Journal]
  6. Hanif D. Sherali, Kaan Ozbay, Shivaram Subramanian
    The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:259-272 [Journal]
  7. Uwe H. Suhl, Heinrich Hilbert
    A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:273-282 [Journal]
  8. Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
    Approximating Steiner trees in graphs with restricted weights. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:283-292 [Journal]
  9. Darko Skorin-Kapov
    Hub network games. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:293-302 [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