Now showing items 1-1 of 1

    • Competitive algorithms for layered graph traversal 

      FIAT, A; FOSTER, DP; KARLOFF, H; RABANI, Y; RAVID, Y; VISHWANATHAN, S (SIAM PUBLICATIONS, 1998)
      A layered graph is a connected graph whose vertices are partitioned into sets L-0 = {s}, L-1; L-2,..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is max{\L-i\}. In ...