Estimating Reachability Set Sizes in Dynamic Graphs

dc.contributor.authorAji, Sudarshan Mandayamen
dc.contributor.committeechairVullikanti, Anil Kumar S.en
dc.contributor.committeememberMarathe, Madhav Vishnuen
dc.contributor.committeememberBisset, Keith R.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2014-07-02T08:01:01Zen
dc.date.available2014-07-02T08:01:01Zen
dc.date.issued2014-07-01en
dc.description.abstractGraphs are a commonly used abstraction for diverse kinds of interactions, e.g., on Twitter and Facebook. Different kinds of topological properties of such graphs are computed for gaining insights into their structure. Computing properties of large real networks is computationally very challenging. Further, most real world networks are dynamic, i.e., they change over time. Therefore there is a need for efficient dynamic algorithms that offer good space-time trade-offs. In this thesis we study the problem of computing the reachability set size of a vertex, which is a fundamental problem, with applications in databases and social networks. We develop the first Giraph based algorithms for different dynamic versions of these problems, which scale to graphs with millions of edges.en
dc.description.degreeMaster of Scienceen
dc.format.mediumETDen
dc.identifier.othervt_gsexam:3077en
dc.identifier.urihttp://hdl.handle.net/10919/49262en
dc.publisherVirginia Techen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectAlgorithmen
dc.subjectDynamic graphsen
dc.subjectGiraphen
dc.subjectGraph frameworken
dc.titleEstimating Reachability Set Sizes in Dynamic Graphsen
dc.typeThesisen
thesis.degree.disciplineComputer Science and Applicationsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Aji_SM_T_2014.pdf
Size:
605.21 KB
Format:
Adobe Portable Document Format

Collections