3-connected Planar Graph Isomorphism is in Log-space

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-128564

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.