Longest paths in Planar DAGs in Unambiguous Logspace

Details Longest paths in Planar DAGs in Unambiguous Logspace Longest paths in Planar DAGs in Unambiguous Logspace

2008-02-12

arxiv.org/abs/0802.1699v1

Computer Science

Computational Complexity

Scientific paper

We show via two different algorithms that finding the length of the longest
path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and
also in the complement class co-UL. The result extends to toroidal DAGs as
well.

Affiliated with

Also associated with

No associations

Rating

Longest paths in Planar DAGs 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 Longest paths in Planar DAGs in Unambiguous Logspace, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest paths in Planar DAGs in Unambiguous Logspace will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675603