Extending the Limits of Tractability and Intractability for Steiner Tree Domination and its Variants on Structured Graphs

dc.contributor.guide	Sadagopan, N
dc.coverage.spatial
dc.creator.researcher	Mohanapriya, A
dc.date.accessioned	2025-10-09T10:48:37Z
dc.date.available	2025-10-09T10:48:37Z
dc.date.awarded	2024
dc.date.completed	2024
dc.date.registered	2019
dc.description.abstract	One of the important aspects of algorithmic graph theory research is to identify the boundaries of tractability and intractability for computationally difficult problems. The objective of this thesis is to analyze the computational complexity of several problems related to the Steiner tree problem and the dominating set problem, in particular, a thin line separating P vs. NPC instances of the Steiner tree and Domination problems, and its variants. newline
dc.description.note
dc.format.accompanyingmaterial	DVD
dc.format.dimensions
dc.format.extent	xiv, 244
dc.identifier.researcherid
dc.identifier.uri	http://hdl.handle.net/10603/667395
dc.language	English
dc.publisher.institution	Department of Computer Science and Engineering
dc.publisher.place	Chennai
dc.publisher.university	Indian Institute of Information Technology Design and Manufacturing Kancheepuram
dc.relation
dc.rights	university
dc.source.university	University
dc.subject.keyword	Computer Science
dc.subject.keyword	Computer Science Hardware and Architecture
dc.subject.keyword	Engineering and Technology
dc.title	Extending the Limits of Tractability and Intractability for Steiner Tree Domination and its Variants on Structured Graphs
dc.title.alternative
dc.type.degree	Ph.D.