A Randomized Parallel Algorithm for Planar Graph Isomorphism
Authors:
- Hillel GazitHGHillel Gazit
- John H ReifJRJohn H Reif
- 31 August 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 28 (2) , 290-314
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A Randomized Parallel Algorithm for Planar Graph IsomorphismJournal of Algorithms, 1998
- Planar Separators and Parallel Polygon TriangulationJournal of Computer and System Sciences, 1995
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a GraphSIAM Journal on Computing, 1991
- Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithmsInformation and Computation, 1991
- On the power of two-point based samplingJournal of Complexity, 1989
- Finding triconnected components by local replacements1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Optimal Tree Contraction in the EREW Model1988
- A parallel algorithm for finding a separator in planar graphs1987
- Linear Algorithms for Isomorphism of Maximal Outerplanar GraphsJournal of the ACM, 1979