Tr\'{e}maux trees and planarity
Combinatorics
2007-05-23 v1
Abstract
We present a simplified version of the DFS-based Left-Right planarity testing and embedding algorithm implemented in Pigale which has been considered as the fastest implemented one [J.M. Boyer, P.F. Cortese, M. Patrignani, and G. Di Battista. Stop minding your P's and Q's: implementing fast and simple DFS-based planarity and embedding algorithm. In Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 25-36. Springer, 2004.]. We give here a simple full justification of the algorithm, based on a preliminary extended study of topological properties of DFS trees.
Cite
@article{arxiv.math/0610935,
title = {Tr\'{e}maux trees and planarity},
author = {Hubert De Fraysseix and Patrice Ossona De Mendez and Pierre Rosenstiehl},
journal= {arXiv preprint arXiv:math/0610935},
year = {2007}
}
Comments
Special Issue on Graph Drawing