Now showing items 1-2 of 2

    • Cascade Algorithm Revisited 

      Takaoka, Tadao; Umehara, Kiyomi (University of Canterbury, 2014)
      We revisit the cascade algorithm for the all pairs shortest path (APSP) problem. The operation on the distace data is limited to the triple operation of min{a, b + c}. The best known complexity on this model is n 3 by ...
    • Cascade algorithm revisited. 

      Takaoka, Tadao; Umehara, Kiyomi (University of Canterbury. Computer Science and Software Engineering, 2014)
      We revisit the cascade algorithm for the all pairs shortest path (APSP) problem. The operation on the distace data is limited to the triple oper- ation of min{a, b + c}. The best known complexity on this model is n3 by ...