Sciweavers

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

31

GD
2004
Springer

favoriteEmaildiscussreport

127views Computer Graphics» more GD 2004»

Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth

14 years 4 months ago

Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth

Download erikdemaine.org

Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor results on which this theory is based, and the remaining open problems.

Erik D. Demaine, Mohammad Taghi Hajiaghayi

Real-time Traffic

Bidimensional Graph Problems | GD 2004 | Theory |

claim paper

Related Content

» Bidimensional Parameters and Local Treewidth

» The Bidimensional Theory of BoundedGenus Graphs

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

» Locally Excluding a Minor

» Bidimensionality and geometric graphs

» Pure Nash equilibria complete characterization of hard and easy graphical games

» On the geometry of graphs with a forbidden minor

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	GD
Authors	Erik D. Demaine, Mohammad Taghi Hajiaghayi

Comments (0)