Finite Playground

To verify is human; to prove, divine.

Complexity of reachability problem on surface graphs

Leave a comment

Directed reachability problem on surface graphs can be solved in poly-time and sub-linear space (!).  See the survey by Vinodchandran Variyam.  

Author: hcsoso

Ph.D. student in the Department of Computer Science, University of Illinois at Urbana-Champaign.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s