Matches in SemOpenAlex for { <https://semopenalex.org/work/W2019040312> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W2019040312 abstract "We present a general framework for constructing cut sparsifiers in undirected graphs --- weighted subgraphs for which every cut has the same weight as the original graph, up to a multiplicative factor of (1 e). Using this framework, we simplify, unify and improve upon previous sparsification results. As simple instantiations of this framework, we show that sparsifiers can be constructed by sampling edges according to their strength (a result of Benczur and Karger), effective resistance (a result of Spielman and Srivastava), edge connectivity, or by sampling random spanning trees. Sampling according to edge connectivity is the most aggressive method, and the most challenging to analyze. Our proof that this method produces sparsifiers resolves an open question of Benczur and Karger.While the above results are interesting from a combinatorial standpoint, we also prove new algorithmic results. In particular, we develop techniques that give the first (optimal) O(m)-time sparsification algorithm for unweighted graphs. Our algorithm has a running time of O(m) + ~O(n/e2) for weighted graphs, which is also linear unless the input graph is very sparse itself. In both cases, this improves upon the previous best running times (due to Benczur and Karger) of O(m log2 n) (for the unweighted case) and O(m log3 n) (for the weighted case) respectively. Our algorithm constructs sparsifiers that contain O(n log n/e2) edges in expectation; the only known construction of sparsifiers with fewer edges is by a substantially slower algorithm running in O(n3 m / e2) time.A key ingredient of our proofs is a natural generalization of Karger's bound on the number of small cuts in an undirected graph. Given the numerous applications of Karger's bound, we suspect that our generalization will also be of independent interest." @default.
- W2019040312 created "2016-06-24" @default.
- W2019040312 creator A5022887225 @default.
- W2019040312 creator A5033068215 @default.
- W2019040312 creator A5039987531 @default.
- W2019040312 creator A5087182068 @default.
- W2019040312 date "2011-01-01" @default.
- W2019040312 modified "2023-10-03" @default.
- W2019040312 title "A general framework for graph sparsification" @default.
- W2019040312 cites W1543491698 @default.
- W2019040312 cites W1595264178 @default.
- W2019040312 cites W1618148629 @default.
- W2019040312 cites W1786780942 @default.
- W2019040312 cites W1971680255 @default.
- W2019040312 cites W1984361668 @default.
- W2019040312 cites W1996575062 @default.
- W2019040312 cites W2004308928 @default.
- W2019040312 cites W2014682451 @default.
- W2019040312 cites W2017501272 @default.
- W2019040312 cites W2018804864 @default.
- W2019040312 cites W2019041817 @default.
- W2019040312 cites W2035228443 @default.
- W2019040312 cites W2045107949 @default.
- W2019040312 cites W2047053799 @default.
- W2019040312 cites W2051540665 @default.
- W2019040312 cites W2062530569 @default.
- W2019040312 cites W2066308383 @default.
- W2019040312 cites W2068888615 @default.
- W2019040312 cites W2072646194 @default.
- W2019040312 cites W2081444009 @default.
- W2019040312 cites W2099463627 @default.
- W2019040312 cites W2125664420 @default.
- W2019040312 cites W2129575457 @default.
- W2019040312 cites W2145192475 @default.
- W2019040312 cites W2148025043 @default.
- W2019040312 cites W2149841335 @default.
- W2019040312 cites W2150516767 @default.
- W2019040312 cites W2162793293 @default.
- W2019040312 cites W2164853353 @default.
- W2019040312 cites W2167064216 @default.
- W2019040312 cites W2168919539 @default.
- W2019040312 cites W2295428206 @default.
- W2019040312 cites W2419092805 @default.
- W2019040312 cites W2950755820 @default.
- W2019040312 cites W2952180316 @default.
- W2019040312 doi "https://doi.org/10.1145/1993636.1993647" @default.
- W2019040312 hasPublicationYear "2011" @default.
- W2019040312 type Work @default.
- W2019040312 sameAs 2019040312 @default.
- W2019040312 citedByCount "68" @default.
- W2019040312 countsByYear W20190403122012 @default.
- W2019040312 countsByYear W20190403122013 @default.
- W2019040312 countsByYear W20190403122014 @default.
- W2019040312 countsByYear W20190403122015 @default.
- W2019040312 countsByYear W20190403122016 @default.
- W2019040312 countsByYear W20190403122017 @default.
- W2019040312 countsByYear W20190403122018 @default.
- W2019040312 countsByYear W20190403122019 @default.
- W2019040312 countsByYear W20190403122020 @default.
- W2019040312 countsByYear W20190403122021 @default.
- W2019040312 countsByYear W20190403122022 @default.
- W2019040312 countsByYear W20190403122023 @default.
- W2019040312 crossrefType "proceedings-article" @default.
- W2019040312 hasAuthorship W2019040312A5022887225 @default.
- W2019040312 hasAuthorship W2019040312A5033068215 @default.
- W2019040312 hasAuthorship W2019040312A5039987531 @default.
- W2019040312 hasAuthorship W2019040312A5087182068 @default.
- W2019040312 hasBestOaLocation W20190403122 @default.
- W2019040312 hasConcept C132525143 @default.
- W2019040312 hasConcept C41008148 @default.
- W2019040312 hasConcept C80444323 @default.
- W2019040312 hasConceptScore W2019040312C132525143 @default.
- W2019040312 hasConceptScore W2019040312C41008148 @default.
- W2019040312 hasConceptScore W2019040312C80444323 @default.
- W2019040312 hasLocation W20190403121 @default.
- W2019040312 hasLocation W20190403122 @default.
- W2019040312 hasOpenAccess W2019040312 @default.
- W2019040312 hasPrimaryLocation W20190403121 @default.
- W2019040312 hasRelatedWork W1503154538 @default.
- W2019040312 hasRelatedWork W1524858705 @default.
- W2019040312 hasRelatedWork W2107367999 @default.
- W2019040312 hasRelatedWork W2333750674 @default.
- W2019040312 hasRelatedWork W2391817034 @default.
- W2019040312 hasRelatedWork W2801014462 @default.
- W2019040312 hasRelatedWork W2900673039 @default.
- W2019040312 hasRelatedWork W3010986440 @default.
- W2019040312 hasRelatedWork W3044187822 @default.
- W2019040312 hasRelatedWork W3095522972 @default.
- W2019040312 isParatext "false" @default.
- W2019040312 isRetracted "false" @default.
- W2019040312 magId "2019040312" @default.
- W2019040312 workType "article" @default.