Sciweavers

CORR
2008
Springer
135views Education» more  CORR 2008»
13 years 11 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
Thomas Thierauf, Fabian Wagner