Computer Science – Computational Complexity
Scientific paper
2008-06-05
Computer Science
Computational Complexity
Scientific paper
We show that the isomorphism of 3-connected planar graphs can be decided in
deterministic log-space. This improves the previously known bound UL$\cap$coUL
of Thierauf and Wagner.
Datta Samir
Limaye Nutan
Nimbhorkar Prajakta
No associations
LandOfFree
3-connected Planar Graph Isomorphism is in Log-space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with 3-connected Planar Graph Isomorphism is in Log-space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 3-connected Planar Graph Isomorphism is in Log-space will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-128564