Now showing items 1-2 of 2

    • Modular design of data-parallel graph algorithms 

      Dash, Santanu; Scholz, Sven-Bodo; Christianson, B. (IEEE Computer Society, 2013)
      Amorphous Data Parallelism has proven to be a suitable vehicle for implementing concurrent graph algorithms effectively on multi-core architectures. In view of the growing complexity of graph algorithms for information ...
    • A scalable approach to computing representative lowest common ancestor in directed acyclic graphs 

      Dash, Santanu; Scholz, Sven-Bodo; Herhut, Stephan; Christianson, B. (2013-11)
      LCA computation for vertex pairs in trees can be achieved in constant time after linear-time preprocessing. However, extension of these techniques to compute LCA for vertex-pairs in DAGs has been not possible due to the ...