Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3022
Title: ProbleMS on Temporal Graphs
Authors: MAITY, SOUMEN
Saurabh, Saket
V M, VISHNU VARDHAN
Dept. of Mathematics
20141100
Keywords: 2019
Mathematics
AlgorithMS
Parameterized Complexity
Temporal Graphs
Issue Date: Apr-2019
Abstract: The idea of temporal graphs can be thought of as a recent addition to the extensively researched concept of graph theory. The advent of cheap wireless communication devices and need of efficient communication protocols, in addition to distributed computation networks has motivated progress in this field. However, the temporal analogues to polynomial time problem on static graphs are very often NP-hard. Thus, there seem to a lot of problems which can be parameterized and explored under various constraints. The study of temporal graphs by parameterized algorithms is a field which is still very much in its infancy, and only a few basic properties and problems have been defined in literature. In this document, we will explore the problem of finding temporal paths parameterized by their length, and a few temporal walk-related problems.
URI: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3022
Appears in Collections:MS THESES

Files in This Item:
File Description SizeFormat 
Thesis.pdf522.12 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.