Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
In this thesis we study the application of a novel sampling technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/4926 |