\(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability (Q2922595)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6355302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability |
scientific article; zbMATH DE number 6355302 |
Statements
$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (English)
0 references
14 October 2014
0 references
0.8925014734268188
0 references
0.8712764978408813
0 references
0.8615272045135498
0 references
0.8076662421226501
0 references
0.8055143356323242
0 references
