A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs

DOI10.1006/jpdc.1998.1514zbMath0922.68091OpenAlexW2063948935MaRDI QIDQ1288544

Bhabani P. Sinha, Srabani Sen Gupta

Publication date: 11 May 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1514

zbMATH Keywords

maximal outerplanar graphs

Mathematics Subject Classification ID

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

Related Items

Bounds of spectral radii on edge-most outer-planar bipartite graphs