Search

Author:

Hofman, Daniel Stephen

Title:

The NP-Completeness of Finding Treewidth for Graphs and a 4-Approximation for Finding Treewidth

Area of Honors:

Interdisciplinary in Computer Engineering and Mathematics

Keywords:

computer science
graph theory
treewidth
NP-completeness
approximation algorithms

File:

Download Treewidth_Thesis.pdf

Thesis Supervisors:

Martin Furer, Thesis Supervisor
Chitaranjan Das, Thesis Honors Advisor
Sergei Tabachnikov, Thesis Honors Advisor