New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. (Q2978548)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. |
scientific article |
Statements
25 April 2017
0 references
reachability
0 references
space complexity
0 references
time-space efficient algorithms
0 references
graphs on surfaces
0 references
minor-free graphs
0 references
Savitch's algorithm
0 references
BBRS bound
0 references
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. (English)
0 references
