Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next?
Graph Algorithms in the Language of Linear Algebra: How Did We Get Here, and Where Do We Go Next?
复制标题
DOI：
10.1109/ipdpsw.2018.00052
复制
发表时间：
2011-07
期刊：
影响因子：
--
通讯作者：
J. Gilbert
中科院分区：
文献类型：
--
作者：
J. Gilbert
数值计算科学主导了高性能计算的前半个世纪；图论通过有效的稀疏矩阵方法服务于数值线性代数。转换是公平的：现在越来越多的计算问题与图本身有关，而稀疏矩阵方法通常是研究图上算法的好方法。这导致了Graph BLAS及其参考实现的漫长道路，这是一个重要的里程碑。但还有很多事情要做。现在发生了什么？
Numerical computational science dominated the first half century of high- performance computing; graph theory served numerical linear algebra by enabling efficient sparse matrix methods. Turnabout is fair play: Nowadays more and more computational problems concern graphs in their own right, and sparse matrix methods are often a good way to look at algorithms on graphs. This has led via a long path to the Graph BLAS and its reference implementations, which are a significant milestone. But there’s a lot left to do. What happens now?