ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
13
views
9
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,630
similar
All similar
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
Author(s):
John M. Boyer
,
Pier Francesco Cortese
,
Maurizio Patrignani
,
Giuseppe Di Battista
Publication date
(Print):
2004
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
Value-based Healthcare
Most cited references
9
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)
0
comments
Cited
192
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Efficient Planarity Testing
John Hopcroft
,
Robert Tarjan
(1974)
0
comments
Cited
113
times
– based on
0
reviews
Review now
Bookmark
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)
0
comments
Cited
21
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Pages
: 25-36
DOI:
10.1007/978-3-540-24595-7_3
SO-VID:
f53eaf64-38d0-46a6-a082-6092f94c4ab6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
pp. 25
Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
pp. 13
An Experimental Study of Crossing Minimization Heuristics
pp. 214
Track Drawings of Graphs with Constant Queue Number
pp. 259
Graph Embedding with Minimum Depth and Maximum External Face
pp. 71
Stretching of Jordan Arc Contact Systems
pp. 98
GraphAEL: Graph Animations with Evolving Layouts
pp. 425
An Energy Model for Visual Graph Clustering
pp. 437
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
pp. 466
Drawing Area-Proportional Venn and Euler Diagrams
pp. 515
Selected Open Problems in Graph Drawing
Similar content
2,630
RestoringPhronesisand practice: marketing’s forgotten P’s
Authors:
Donncha Kavanagh
The 5 P’s: The Postoperative Pain Patient, a Preoperative Priority
Authors:
Karen Belford
,
Maureen Diver
,
Mary Irwin
…
Alphabet soup: Blurring the distinctions between p’s and alpha’s in psychological research
Authors:
R. HUBBARD
See all similar
Cited by
3
Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
Authors:
John M. Boyer
,
Pier Francesco Cortese
,
Maurizio Patrignani
…
Additional PC-Tree Planarity Conditions
Authors:
John M. Boyer
Pfaffian Circuits
Authors:
Jason Morton
See all cited by