An efficient parallel algorithm for planarity
- 31 October 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (2) , 190-246
- https://doi.org/10.1016/0022-0000(88)90006-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An efficient parallel algorithm for planarityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- An optimal parallel algorithm for integer sortingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Implementation of simultaneous memory address access in models that forbid itJournal of Algorithms, 1983
- A Linear Time Algorithm for Deciding Interval Graph IsomorphismJournal of the ACM, 1979
- 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
- A combinatorial condition for planar graphsFundamenta Mathematicae, 1937
- Non-separable and planar graphsTransactions of the American Mathematical Society, 1932