Construct · 1 fields · 1 citations

cut sparsifier: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

a sparse weighted subgraph that approximately preserves the value of every cut in the original graph, built by importance sampling of edges.

In graph algorithms, cut sparsifier refers to a sparse weighted subgraph that approximately preserves the value of every cut in the original graph, built by importance sampling of edges. This meaning comes from Benczúr (2015) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how cut sparsifier sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

value6 fields · 12 citationsjingle · one name, six constructs

References

Benczúr, A. A., & Karger, D. R. (2015). Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. SIAM Journal on Computing, 44(2), 290-319. https://doi.org/10.1137/070705970

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct