Dynamic programming and planarity: Improved tree-decomposition based algorithms

@article{Dorn2010DynamicPA,
  title={Dynamic programming and planarity: Improved tree-decomposition based algorithms},
  author={Frederic Dorn},
  journal={Discrete Applied Mathematics},
  year={2010},
  volume={158},
  pages={800-808}
}
Westudy some structural properties for tree-decompositions of 2-connected planar graphs that we use to improve upon the runtime of tree-decomposition based dynamic programming approaches for several NP-hard planar graph problems. E.g., we derive the fastest algorithm for Planar Dominating Set of runtime 3tw · nO(1), when we take the width tw of a given tree-decomposition as the measure for the exponential worst case behavior. We also introduce a tree-decomposition based approach to solve non… CONTINUE READING
BETA