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

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.

• Type: Conference
• Year: 2004
• Where: GD
• Authors: Erik D. Demaine, Mohammad Taghi Hajiaghayi
• Keywords: Bidimensional Graph Problems, GD 2004, Theory