Depth-First Search in Directed Planar Graphs, Revisited (Q6168415)
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: Depth-First Search in Directed Planar Graphs, Revisited |
scientific article; zbMATH DE number 7724180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Depth-First Search in Directed Planar Graphs, Revisited |
scientific article; zbMATH DE number 7724180 |
Statements
8 August 2023
0 references
depth-first search
0 references
planar digraphs
0 references
parallel algorithms
0 references
space-bounded complexity classes
0 references
Depth-First Search in Directed Planar Graphs, Revisited (English)
0 references
1.0000001
0 references
0.91239226
0 references
0.9112614
0 references
0 references
0.9022852
0 references
0.8962724
0 references
0.89295924
0 references
0.8870593
0 references
0.88653326
0 references
0.8808528
0 references
