Abstract: A seminal work of [Ahn-Guha-McGregor, PODS’12] showed that one can compute a cut sparsifier of an unweighted undirected graph by taking a near-linear number of linear measurements on the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback