Lossy Kernels for Few Graph Contraction ProbleMS

Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/2945

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	MAITY, SOUMEN	en_US
dc.contributor.advisor	Saurabh, Saket	en_US
dc.contributor.author	GUNDA, SPOORTHY	en_US
dc.date.accessioned	2019-05-09T08:10:38Z
dc.date.available	2019-05-09T08:10:38Z
dc.date.issued	2019-04	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/2945	-
dc.description.abstract	We study a few graph contraction problems Chordal Contraction, Clique Contraction and Split Contraction, from the viewpoint of Lossy Kernelization, which is a recently introduced framework to study NP-hard problems. H-Contraction problem is to find set of edges such that when contracted will give the graph H. We study approximate kernel for the minimization version of these problems by including some parameters.	en_US
dc.language.iso	en	en_US
dc.subject	2019
dc.subject	Lossy Kernels	en_US
dc.subject	Graph Contraction	en_US
dc.title	Lossy Kernels for Few Graph Contraction ProbleMS	en_US
dc.type	Thesis	en_US
dc.type.degree	BS-MS	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.contributor.registration	20141111	en_US
Appears in Collections:	MS THESES

Files in This Item:

File	Description	Size	Format
Final_Thesis_spoorthy.pdf		1.27 MB	Adobe PDF	View/Open