Reachability on prefix-recognizable graphs

13 years 4 months ago

Download www.informatik.uni-bremen.de

We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachability, Prefix-recognizable graphs, Computational complexity, Alternation

Stefan Göller

Real-time Traffic

Deterministic Exponential Time | IPL 2008 | Prefix-recognizable Graphs Reachability | Reachability |

claim paper

» An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance

» A Uniform Framework for AdHoc Indexes to Answer Reachability Queries on Large Graphs

» Using Disjoint Reachability for Parallelization

» SCARAB scaling reachability computation on large graphs

» Directed Planar Reachability is in Unambiguous LogSpace

» When Is Reachability Intrinsically Decidable

» The Directed Planar Reachability Problem

» A LogSpace Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Stefan Göller

Comments (0)

Sciweavers

Reachability on prefix-recognizable graphs

Deterministic Exponential Time | IPL 2008 | Prefix-recognizable Graphs Reachability | Reachability |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers