1. The NP-Completeness of Finding Treewidth for Graphs and a 4-Approximation for Finding Treewidth Open Access 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 sciencegraph theorytreewidthNP-completenessapproximation algorithms File: Download Treewidth_Thesis.pdf Thesis Supervisors: Martin Furer, Thesis SupervisorChitaranjan Das, Thesis Honors AdvisorSergei Tabachnikov, Thesis Honors Advisor
