Dynamic Complexity of Directed Reachability and Other Problems

DOI10.1007/978-3-662-43948-7_30zbMath1364.05070OpenAlexW212707552MaRDI QIDQ5167755

Raghav Kulkarni, Samir Datta, William Hesse

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_30

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Reachability is in DynFO ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Dynamic complexity of expansion

This page was built for publication: Dynamic Complexity of Directed Reachability and Other Problems