Now showing items 1-2 of 2

    • Hoke, Tanner
      Classically, many graph algorithms in computer science operate on representations of graphs other than the adjacency matrix. For example, the breadth-first search and many more complex shortest-path algorithms most often ...
    • Waheed, Abeer
      Creating Graph algorithms as fast as possible, in as little time as possible, is a key goal for countless data scientists. To this end, GraphBLAS can be used. GraphBLAS is a standard that defines sparse matrix operations ...