The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace

Thomas Thierauf, Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. Electronic Colloquium on Computational Complexity (ECCC), 14(068), 2007. [doi]

Authors

Thomas Thierauf

This author has not been identified. Look up 'Thomas Thierauf' in Google

Fabian Wagner

This author has not been identified. Look up 'Fabian Wagner' in Google