An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896)
From MaRDI portal
scientific article; zbMATH DE number 7140849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs |
scientific article; zbMATH DE number 7140849 |
Statements
An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (English)
0 references
6 December 2019
0 references
directed reachability problem
0 references
layered grid graph
0 references
layered planar graph
0 references
time-space tradeoff
0 references
