![Spanning tree / Network flow / Graph connectivity / Maximum flow problem / Randomized algorithm / Minimum spanning tree / Connectivity / Cut / SL / Theoretical computer science / Graph theory / Mathematics Spanning tree / Network flow / Graph connectivity / Maximum flow problem / Randomized algorithm / Minimum spanning tree / Connectivity / Cut / SL / Theoretical computer science / Graph theory / Mathematics](https://www.pdfsearch.io/img/01fd3804a95f84cd5e7d559d817b2bbf.jpg) Date: 2011-03-31 22:48:01Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics | | Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †Add to Reading ListSource URL: ccom.uprrp.eduDownload Document from Source Website File Size: 444,89 KBShare Document on Facebook
|