Computing Fundamental Colored Graph Properties in Sublinear Time

Please enable javascript in your browser.

Bahrami, Mohammad Reza | 2017

718 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 50090 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Abam, Mohammad Ali
Abstract:
Because of growing amount of data which communicated across the world, analyzing massive data set becomes more important than ever. The graph structure as an important and broadly used data structure is much more important than others. In this thesis, besides introducing the sublinear time algorithm model for massive data as a very efficient and superfast method to deal with massive data, we use them to solve problems for colored graphs. As a fundamental property, we try to compute the average of colored degree. This problem is analyzed from different aspects with various limitation. Two algorithms with multiplicative approximation factor, based on the average degree of simple graphs are designed. Moreover, we present one algorithm with fewer limitation and using more general assumptions, but with an additive error. After all, based on last two algorithms, we propose a 2-approximation algorithm. At the end, we presented some problems
Keywords:
Massive Data ; Huge Graph ; Sublinear Time Algorithms ; Colored Graphs ; Average Colored Degree