A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem is equivalent to the NL vs L problem. This paper focuses on the reachability problem over planar graphs where the comple...

Full description

Bibliographic Details

Published in:	2010 IEEE 25th Annual Conference on Computational Complexity pp. 131 - 138
Main Authors:	Stolee, Derrick, Bourke, Chris, Vinodchandran, N V
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2010
Subjects:	acyclic digraph Algorithm design and analysis Complexity theory Computational complexity Computer science Concurrent computing Jacobian matrices logspace algorithm Mathematics Parallel processing Particle separators planar graph reachability USA Councils
ISBN:	9781424472147, 1424472148
ISSN:	1093-0159
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!