Sub-linear algorithms for graph problems
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Main Author: | Yodpinyanee, Anak |
---|---|
Other Authors: | Ronitt Rubinfeld. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/120411 |
Similar Items
-
Local computation algorithms for graphs of non-constant degrees
by: Yodpinyanee, Anak
Published: (2015) -
Improved distributed algorithms for fundamental graph problems
by: Ghaffari, Mohsen
Published: (2017) -
Graph bisection algorithms
by: Bui, Thang Nguyen
Published: (2013) -
Linear graph reduction : confronting the cost of naming
by: Bawden, Alan
Published: (2005) -
Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.
by: Levine, Matthew S. (Matthew Steven)
Published: (2005)