Every Graph Is Essentially Sparse.
An introduction is presented to the article "Spectral Sparsification of Graphs: Theory and Algorithms," by Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng, about the spectral similarity of weighted graphs to sparse graphs in computer science.
| Published in: | Communications of the ACM Vol. 56; no. 8; pp. 86 - 87 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
Association for Computing Machinery
Aug2013
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |