An efficient parallel algorithm for planarity
Philip N. Klein, John H. Reif · Journal of Computer and System Sciences · 1988
Cited by 80 works. doi:10.1016/0022-0000(88)90006-2
Authors
References
- Graph Theory with Applications
- Non-separable and planar graphs
- Graph Theory with Applications
- Efficient Planarity Testing
- Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Parallelism in random access machines
- Selected topics in graph theory 3
- Topological Graph Theory
- A combinatorial condition for planar graphs