Streaming Algorithms and Parameterized Streaming

Natti, B S (2015) Streaming Algorithms and Parameterized Streaming. Masters thesis, Indian Institute of Technology Hyderabad.

[img] Text
CS13M1006.pdf - Submitted Version
Restricted to Registered users only until 26 June 2018.

Download (760kB) | Request a copy

Abstract

Over the last few years, there has been considerable amount of study and work on developing algorithms for processing massive graphs in the data stream model. Storing massive graphs in the memory of a single machine is not practical which is what the motivation behind data stream algorithms. To obtain space and time efficient algorithms, we develop streaming/semi-streaming algorithms where it is reasonable to assume that the input graph arrives as a stream of edges. We can process the input in either one or multiple passes and the working memory space is restricted.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Item Type: Thesis (Masters)
Uncontrolled Keywords: Streaming, Parameterized Streaming, Matching, Edge Dominating Set; TD334
Subjects: Computer science > Special computer methods
Computer science > Big Data Analytics
Divisions: Department of Computer Science & Engineering
Depositing User: Library Staff
Date Deposited: 29 Jun 2015 10:35
Last Modified: 10 Jul 2015 06:21
URI: http://raiith.iith.ac.in/id/eprint/1607
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 1607 Statistics for this ePrint Item