Table of contents for Graph algorithms in the language of linear algebra / Jeremy Kepner, John Gilbert.
Bibliographic record and links to related information available from the Library of Congress catalog
Information from electronic data provided by the publisher. May be incomplete or contain other coding.
Preface; Part I. Algorithms: 1. Graphs and matrices; 2. Linear algebraic notation and definitions; 3. Connected components and minimum paths; 4. Some graph algorithms in an array-based language; 5. Fundamental graph algorithms; 6. Complex graph algorithms; 7. Multilinear algebra for analyzing data with multiple linkages; 8. Subgraph detection; Part II. Data: 9. Kronecker graphs; 10. The Kronecker theory of power law graphs; 11. Visualizing large Kronecker graphs; Part III. Computation: 12. Large-scale network analysis; 13. Implementing sparse matrices for graph algorithms; 14. New ideas in sparse matrix-matrix multiplication; 15. Parallel mapping of sparse computations; 16. Fundamental questions in the analysis of large graphs; Index.
Library of Congress subject headings for this publication: