Planarity testing in parallel
From MaRDI portal
Publication:1342859
DOI10.1016/S0022-0000(05)80070-4zbMATH Open0938.68948MaRDI QIDQ1342859FDOQ1342859
Authors: Vijaya Ramachandran, J. Reif 
Publication date: 21 June 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved algorithms for graph four-connectivity
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Title not available (Why is that?)
- Efficient Planarity Testing
- Title not available (Why is that?)
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
- Title not available (Why is that?)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- An Efficient Parallel Biconnectivity Algorithm
- Title not available (Why is that?)
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Dividing a Graph into Triconnected Components
- How to Draw a Graph
- Title not available (Why is that?)
- Parallel Tree Contraction Part 2: Further Applications
- Computing an st-numbering
- Title not available (Why is that?)
- A new graph triconnectivity algorithm and its parallelization
- Towards optimal parallel bucket sorting
- An efficient parallel algorithm for planarity
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Parallel Algorithms in Graph Theory: Planarity Testing
- Title not available (Why is that?)
- Finding Triconnected Components by Local Replacement
- Symmetric Complementation
Cited In (4)
This page was built for publication: Planarity testing in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342859)
