Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring (2005)

by Erik D. Demaine , Mohammadtaghi Hajiaghayi , Ken-ichi Kawarabayashi

Venue:	In 46th Annual IEEE Symposium on Foundations of Computer Science
Citations:	36 - 9 self

Datum	Value	Source
TITLE	Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring	INFERENCE
AUTHOR NAME	Erik D. Demaine	SVM HeaderParse 0.2
AUTHOR NAME	Mohammadtaghi Hajiaghayi	SVM HeaderParse 0.2
AUTHOR NAME	Ken-ichi Kawarabayashi	SVM HeaderParse 0.2
ABSTRACT	At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is used throughout graph theory and graph algorithms, but is existential. We develop a polynomialtime algorithm using topological graph theory to decompose a graph into the structure guaranteed by the theorem: a clique-sum of pieces almost-embeddable into boundedgenus surfaces. This result has many applications. In particular, we show applications to developing many approximation algorithms, including a 2-approximation to graph coloring, constant-factor approximations to treewidth and the largest grid minor, combinatorial polylogarithmicapproximation to half-integral multicommodity flow, subexponential fixed-parameter algorithms, and PTASs for many minimization and maximization problems, on graphs excluding a fixed minor. 1.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In 46th Annual IEEE Symposium on Foundations of Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	637--646	INFERENCE
CITATIONS	53 found	ParsCit 1.0