A general framework for graph sparsification. (English) Zbl 1288.68118
Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 71-80 (2011).
MSC:
| 68Q25 | Analysis of algorithms and problem complexity |
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 05C22 | Signed and weighted graphs |
| 05C40 | Connectivity |
| 68W25 | Approximation algorithms |
| 68Q87 | Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) |
