Sciweavers

ESA
2010
Springer
136views Algorithms» more  ESA 2010»
14 years 17 days ago
Fast Minor Testing in Planar Graphs
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...