Trémaux trees and planarity

Details Trémaux trees and planarity Trémaux trees and planarity

2006-10-30

arxiv.org/abs/math/0610935v1

International Journal of Foundations of Computer Science 17 (5) (2006) 1017-1029

Mathematics

Combinatorics

Special Issue on Graph Drawing

Scientific paper

10.1142/S0129054106004248

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.

Affiliated with

Also associated with

No associations

Rating

Trémaux trees and planarity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trémaux trees and planarity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trémaux trees and planarity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231167