1 paper · 1 filter
Thomas Thierauf, Fabian Wagner
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 algorithms…