Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding AlgorithmLecture Notes in Computer Science, 2004
- A new planarity testTheoretical Computer Science, 1999
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithmAlgorithmica, 1996
- A characterization of planar graphs by trémaux ordersCombinatorica, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Efficient Planarity TestingJournal of the ACM, 1974