A Randomized Parallel Algorithm for Planar Graph Isomorphism

DOI10.1006/JAGM.1998.0943MaRDI QIDQ4209267zbMATH OpenOpenAlexFDO

Authors Hillel Gazit, J. Reif

Publication date 6 October 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1998.0943

zbMATH Keywords

parallel randomized algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel algorithms for planar graph isomorphism and related problems
• Parallel Tree Contraction Part 2: Further Applications
• scientific article; zbMATH DE number 4060741
• Isomorphism of planar graphs (working paper)

Cited in

(12)

• A parallelization of Miller's \(n^{\log n}\) isomorphism technique
• scientific article; zbMATH DE number 4213471 (Why is no real title available?)
• Algorithm and Experiments in Testing Planar Graphs for Isomorphism
• scientific article; zbMATH DE number 4049079 (Why is no real title available?)
• scientific article; zbMATH DE number 4060741 (Why is no real title available?)
• scientific article; zbMATH DE number 4064509 (Why is no real title available?)
• Parallel algorithms for planar graph isomorphism and related problems
• Parallel Tree Contraction Part 2: Further Applications
• An algorithm for optimal isomorphism between two random graphs
• scientific article; zbMATH DE number 3995071 (Why is no real title available?)
• Isomorphism of planar graphs (working paper)
• Topological recognition of polyhedral objects from multiple views

This page was built for publication: A Randomized Parallel Algorithm for Planar Graph Isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209267)