Tree-Decomposition

Joshi, Archit Pradeep and N R, Aravind (2017) Tree-Decomposition. Masters thesis, Indian Insitute of Technology Hyderabad.

Text CS15MTECH11005.pdf - Submitted Version Restricted to Registered users only until 2 July 2020. Download (2MB) | Request a copy

Abstract

The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is a representation of G in a tree-like structure. Sometimes problems which are NP-hard in general are solvable in polynomial or even linear time when restricted to trees. Many problems can be solved e

[error in script]

IITH Creators:	IITH Creators ORCiD N R, Aravind UNSPECIFIED
Item Type:	Thesis (Masters)
Uncontrolled Keywords:	convex graph, co-traingulated graphs, TD853
Subjects:	Computer science
Divisions:	Department of Computer Science & Engineering
Depositing User:	Team Library
Date Deposited:	03 Jul 2017 10:14
Last Modified:	04 Jul 2019 04:29
URI:	http://raiithold.iith.ac.in/id/eprint/3331
Publisher URL:
Related URLs:	Google Scholar

Actions (login required)

View Item

Statistics for this ePrint Item