Login / Signup
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace.
Thomas Thierauf
Fabian Wagner
Published in:
Theory Comput. Syst. (2010)
Keyphrases
</>
connected graphs
graph theory
closed form
neural network
data mining
data structure
planar graphs