Login / Signup

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

Thomas ThieraufFabian Wagner
Published in: STACS (2008)
Keyphrases
  • connected graphs
  • graph theory
  • single point
  • graph isomorphism
  • planar surfaces
  • graph search
  • decision trees
  • markov random field
  • line drawings