Sciweavers

2 search results - page 1 / 1
» Decomposition, Approximation, and Coloring of Odd-Minor-Free...
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 2 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
FOCS
2005
IEEE
13 years 11 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
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 ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...