A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1288544)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs |
scientific article; zbMATH DE number 1286781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs |
scientific article; zbMATH DE number 1286781 |
Statements
A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs (English)
0 references
11 May 1999
0 references
maximal outerplanar graphs
0 references
