The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:33, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The isomorphism problem for planar 3-connected graphs is in unambiguous logspace |
scientific article |
Statements
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (English)
0 references
6 October 2010
0 references
planar graph isomorphism
0 references
three connected graphs
0 references
unambiguous logspace
0 references
