The following paper by Batson, Spielman, Srivastava, and Teng surveys one of the most important recent intellectual achievements of theoretical computer science, demonstrating that every weighted graph is close to a sparse graph.
Home → Magazine Archive → August 2013 (Vol. 56, No. 8) → Technical Perspective: Every Graph Is Essentially... → Abstract
Technical Perspective: Every Graph Is Essentially Sparse
No entries found
Log in to Read the Full Article
Purchase the Article