$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Tetsuo Asano / rank | |||
| Property / author | |||
| Property / author: Q208477 / rank | |||
Revision as of 05:54, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability |
scientific article |
Statements
$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (English)
0 references
14 October 2014
0 references
