Planar and grid graph reachability problems (Q733742)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar and grid graph reachability problems |
scientific article; zbMATH DE number 5617715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar and grid graph reachability problems |
scientific article; zbMATH DE number 5617715 |
Statements
Planar and grid graph reachability problems (English)
0 references
19 October 2009
0 references
planar graphs
0 references
grid graphs
0 references
reachability
0 references
circuit complexity
0 references
logspace
0 references
algorithms
0 references
complexity theory
0 references
0 references
0 references
0.9036015272140504
0 references
0.8441455960273743
0 references
0.83741694688797
0 references
0.8059117794036865
0 references
0.7880545258522034
0 references
