An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
From MaRDI portal
Publication:1604311
DOI10.1006/jpdc.2001.1787zbMath1007.68209OpenAlexW2048197731MaRDI QIDQ1604311
Shan-Chyun Ku, Biing-Feng Wang
Publication date: 4 July 2002
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.2001.1787
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
This page was built for publication: An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
