Sat 22 Jun 2019 12:00 - 12:30 at 106C - Session 3 Chair(s): Martin Elsman

There is a recent push by a segment of the graph community to implement graph algorithms in the language of linear algebra. However, graph algorithms that depend on depth-first search techniques are often highlighted as limitations of the linear algebraic approach as there are no existing formulation of depth-first search graph algorithms expressed in the language of linear algebra. This paper provides a linear algebraic approach for developing depth-first search graph traversal algorithms and demonstrates its use for defining three classical DFS-based algorithms: Binary tree traversal, graph traversal, and biconnected components.

Sat 22 Jun

11:30 - 12:30: ARRAY 2019 - Session 3 at 106C
Chair(s): Martin ElsmanUniversity of Copenhagen, Denmark
ARRAY-2019-papers11:30 - 12:00
Benjamin ChetiouiUniversity of Bergen, Norway, Lenore MullinSUNY Albany, USA, Ole Abusdal, Magne HaveraaenUniversity of Bergen, Norway, Jaakko JärviUniversity of Bergen, Sandra MaciàBarcelona Supercomputing Center
ARRAY-2019-papers12:00 - 12:30