- Record: found
- Abstract: not found
- Book Chapter: not found
Graph Drawing
Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
other
Read this book at
Publisher
Powered by 
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references9
- Record: found
- Abstract: not found
- Article: not found
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Kellogg S. Booth, George S. Lueker (1976)
- Record: found
- Abstract: not found
- Article: not found
Efficient Planarity Testing
John Hopcroft, Robert Tarjan (1974)
- Record: found
- Abstract: not found
- Article: not found
A linear algorithm for embedding planar graphs using PQ-trees
Takao Nishizeki, Norishige Chiba, Takao Ozawa … (1985)