A linear algorithm for embedding planar graphs using PQ-trees
- 1 February 1985
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 30 (1), 54-76
- https://doi.org/10.1016/0022-0000(85)90004-2
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Computing an st-numberingTheoretical Computer Science, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973