Graph and geometric algorithms on distributed networks and databases
In this thesis, we study the power and limit of algorithms on various models, aiming at applications in distributed networks and databases. In distributed networks, graph algorithms are fundamental to many applications. We focus on computing random walks which are an important primitive employed in...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/41056 |