Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
2010
ACM

favoriteEmaildiscussreport

216views Algorithms» more SODA 2010»

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs

14 years 1 months ago

Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs

Download erikdemaine.org

Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich

Real-time Traffic

Discrete Algorithms | Odd-Minor-Free Graphs | SODA 2010 |

claim paper

Related Content

» Algorithmic Graph Minor Theory Decomposition Approximation and Coloring

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi

Comments (0)