Reachability Problems: An Update
From MaRDI portal
Publication:5426862
DOI10.1007/978-3-540-73001-9_3zbMath1151.68561OpenAlexW1597166809MaRDI QIDQ5426862
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (5)
Balancing bounded treewidth circuits ⋮ When Is Reachability Intrinsically Decidable? ⋮ Space Complexity of Reachability Testing in Labelled Graphs ⋮ Unnamed Item ⋮ Space complexity of reachability testing in labelled graphs
This page was built for publication: Reachability Problems: An Update
