A distributed algorithm for graph sparsification
There has been plenty of work on graph cut sparsi cation. Previous works use either combinatorial graph techniques or algebraic graph techniques to obtain the most important parameter in a random sampling process, the probability pe for each edge e. Sampling each edge according to this pe respective...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/62140 |