Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Demaine, Erik D. and Hajiaghayi, MohammadTaghi (2004) Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 517-533 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_57).
Full text not available from this repository.
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.
Repository Staff Only: item control page