Reachability Problems: An Update
From MaRDI portal
Publication:5426862
DOI10.1007/978-3-540-73001-9_3zbMATH Open1151.68561OpenAlexW1597166809MaRDI QIDQ5426862FDOQ5426862
Authors: Eric Allender 
Publication date: 13 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_3
Recommendations
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Planar and grid graph reachability problems
- Connectivity vs. reachability
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
- Space complexity of the directed reachability problem over surface-embedded graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cited In (11)
- Planar and grid graph reachability problems
- When Is Reachability Intrinsically Decidable?
- Space complexity of the directed reachability problem over surface-embedded graphs
- A repeated-update problem in the DeltaBlue algorithm
- Title not available (Why is that?)
- Space Complexity of Reachability Testing in Labelled Graphs
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Balancing bounded treewidth circuits
- Space complexity of reachability testing in labelled graphs
- Complexity of testing reachability in matroids
- Reachability Problems on Directed Graphs
This page was built for publication: Reachability Problems: An Update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426862)
