Spectral Sparsification of Graphs

Spielman, D. A., & Teng, S. (2011). Spectral Sparsification of Graphs. SIAM Journal on Computing, 40(4), 981-1025.

Type

Journal article

Intellectual base

Primary research

Year

2011

Volume

40

Issue

4

Pages

981-1025

DOI

10.1137/08074489x

DOI registrant

Society for Industrial & Applied Mathematics

Link

https://doi.org/10.1137/08074489X

Cited by

1 citation across 1 artifact.

Mechanisms

• Graph Sparsification Pass
  • Where an ad hoc deletion offers no guarantee, a sparsifier offers a bound: the classic result is spectral sparsification

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:5b70dd3ad39f · see in the full table