lecture9 - massachusetts institute of...
TRANSCRIPT
![Page 1: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/1.jpg)
![Page 2: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/2.jpg)
![Page 3: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/3.jpg)
![Page 4: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/4.jpg)
![Page 5: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/5.jpg)
![Page 6: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/6.jpg)
![Page 7: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/7.jpg)
![Page 8: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/8.jpg)
![Page 9: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/9.jpg)
![Page 10: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/10.jpg)
![Page 11: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/11.jpg)
![Page 12: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/12.jpg)
![Page 13: lecture9 - Massachusetts Institute of Technologycourses.csail.mit.edu/6.889/fall11/lectures/L09.pdf · References [DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence](https://reader035.vdocuments.us/reader035/viewer/2022070108/602fed3acdb9c4021813438b/html5/thumbnails/13.jpg)
References
[DH04] Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalenceof local treewidth and linear local treewidth and its algorith-mic applications. In SODA ’04: Proceedings of the 15th annualACM-SIAM Symposium on Discrete Algorithms, pages 840–849,Philadelphia, PA, USA, 2004. Society for Industrial and AppliedMathematics.
[DHK05] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichiKawarabayashi. Algorithmic graph minor theory: Decomposition,approximation, and coloring. In FOCS ’05: Proceedings of the 46thannual IEEE Symposium on Foundations of Computer Science,pages 637–646, Washington, DC, USA, 2005. IEEE Computer So-ciety.
[Epp00] David Eppstein. Diameter and treewidth in minor-closed graphfamilies. 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 algorithmand shorter proof for the graph minor decomposition. In STOC’11:Proceedings of the 43rd ACM Symposium on Theory of Computing,pages 451–458, 2011.