Spectral Sparsification of Graphs: Theory and Algorithms.

The article discusses graph sparsification as an approximation of arbitrary graphs by sparse graphs, focusing on the potential implementation of graph sparsification in designing nearly linear-time algorithms for solving some linear equation systems with diagonally dominant matrices and finding maxi...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 56; no. 8; pp. 87 - 95
Autores principales:	Batson, Joshua, Spielman, Daniel A., Teng, Shang-Hua, Srivastava, Nikhil
Formato:	Artículo
Publicado:	Association for Computing Machinery Aug2013
Materias:	Graph theory Sparse graphs Algorithm research Network analysis (Planning) Laplacian matrices Linear equations
Acceso en línea:	Ver este registro en EBSCOhost