Graph Algorithms in the Language of Linear Algebra

By Tinkara Toš. 2012

372 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Suhas N. Diggavi
2. John R. Gilbert
3. Deepesh Data
4. Aydin Buluç
5. Linqi Song

In Computer Networks and Communications

1. Aydin Buluç
2. Suhas N. Diggavi
3. John R. Gilbert
4. Deepesh Data
5. Linqi Song

In Computer Vision and Pattern Recognition

1. Aydin Buluç
2. Suhas N. Diggavi
3. John R. Gilbert
4. Deepesh Data
5. Linqi Song

Citations in the corpus

• Data Encoding for Byzantine-Resilient Distributed Optimization (2019, methodology): “…of a diagonalizable matrix, which is used in Google’s PageRank algorithm [ISW06], Twitter’s recommendation system [GGL + 13], etc.; (ii) iterative methods for solving sparse linear systems [Saa03]; (iii) many graph algorithms, where the graph is represented by a fixed adjacency matrix, [KG11].”
• The Combinatorial BLAS: design, implementation, and applications (2011, background): “The Basic Linear Algebra Subroutines (BLAS) for numerical linear algebra (Lawson et al., 1979) are probably the canonical example of a successful primitives package.”