{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L05 - tion Parameterized Complexity and Practical Aspects...

Info iconThis preview shows pages 1–9. 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
References [HKRS97] Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences , 55(1):3–23, 1997. Pre- viously appeared STOC ’94: Proceedings of the 26th annual ACM Symposium on Theory of Computing, pp. 27–37, ACM Press. [RW09] Bruce Reed and David R. Wood. A linear-time algorithm to find a separator in a graph excluding a minor. ACM Transactions on Algorithms , 5(4):1–16, 2009. [Taz10] Siamak Tazari. Algorithmic Graph Minor Theory: Approxima-
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: tion, Parameterized Complexity, and Practical Aspects . PhD the-sis, Humboldt-Univerist¨ at zu Berlin, Berlin, Germany, 2010. [TMH09] Siamak Tazari and Matthias M¨uller-Hannemann. Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discrete Applied Mathematics , 157:673–684, 2009. An extended abstract appeared in WG ’08: Proceedings of the 34th Workshop on Graph Theoretic Concepts in Computer Science, LNCS 5344, pp. 360–371, Springer, 2008....
View Full Document

{[ snackBarMessage ]}