This
preview
has intentionally blurred sections.
Sign up to view the full version.
This
preview
has intentionally blurred sections.
Sign up to view the full version.
This
preview
has intentionally blurred sections.
Sign up to view the full version.
This
preview
has intentionally blurred sections.
Sign up to view the full version.
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
- Fall '11
- ErikDemaine
- Algorithms, Graph Theory, ACM, Siamak Tazari, Graph Theoretic Concepts, Algorithmic Graph Minor, Monika R. Henzinger
-
Click to edit the document details