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

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

2008-02-20

arxiv.org/abs/0802.2825v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Data Structures and Algorithms

Scientific paper

The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the upper bound for planar 3-connected graphs to unambiguous logspace, in fact to $UL \cap coUL$. As a consequence of our method we get that the isomorphism problem for oriented graphs is in $NL$. We also show that the problems are hard for $L$.

Affiliated with

Also associated with

No associations

Rating

The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace 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 The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647736