Graphs and matrices
January 1, 2012
Book Chapter
Author:
Published in:
Graph Algorithms in the Language of Linear Algebra, pp. 3-12
R&D Area:
R&D Group:
Summary
A linear algebraic approach to graph algorithms that exploits the sparse adjacency matrix representation of graphs can provide a variety of benefits. These benefits include syntactic simplicity, easier implementation, and higher performance. Selected examples are presented illustrating these benefits. These examples are drawn from the remainder of the book in the areas of algorithms, data analysis, and computation.