Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0215058 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998776409 / rank | |||
Normal rank | |||
Latest revision as of 23:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel Algorithms for Depth-First Searches I. Planar Graphs |
scientific article |
Statements
Parallel Algorithms for Depth-First Searches I. Planar Graphs (English)
0 references
1986
0 references
inherently sequential problems
0 references
unbounded-parallel algorithm
0 references
depth-first search
0 references
planar undirected graph
0 references
depth-first spanning tree
0 references
