L09 - pages 637–646 Washington DC USA 2005 IEEE Computer...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 12
References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence of local treewidth and linear local treewidth and its algorith- mic applications. In SODA ’04: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms , pages 840–849, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics. [DHK05] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In FOCS ’05: Proceedings of the 46th annual IEEE Symposium on Foundations of Computer Science
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , pages 637–646, Washington, DC, USA, 2005. IEEE Computer So-ciety. [Epp00] David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica , 27(3):275–291, 2000. [Gro03] Martin Grohe. Local tree-width, excluded minors, and approxi-mation algorithms. Combinatorica , 23(4):613–632, 2003. [KW11] Ken-ichi Kawarabayashi and Paul Wollan. A simpler algorithm and shorter proof for the graph minor decomposition. In STOC’11: Proceedings of the 43rd ACM Symposium on Theory of Computing , pages 451–458, 2011....
View Full Document

{[ snackBarMessage ]}

Page1 / 13

L09 - pages 637–646 Washington DC USA 2005 IEEE Computer...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online