An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1604311): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jpdc.2001.1787 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jpdc.2001.1787 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048197731 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JPDC.2001.1787 / rank | |||
Normal rank | |||
Latest revision as of 22:29, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs |
scientific article |
Statements
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs (English)
0 references
4 July 2002
0 references
outerplanar graph
0 references
