default search action
"The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous ..."
Thomas Thierauf, Fabian Wagner (2008)
- Thomas Thierauf, Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. STACS 2008: 633-644
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.