An efficient parallel algorithm for shifting the root of a depth first spanning tree (Q3725546): 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.1016/0196-6774(86)90040-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007923771 / rank | |||
Normal rank | |||
Latest revision as of 02:03, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for shifting the root of a depth first spanning tree |
scientific article |
Statements
An efficient parallel algorithm for shifting the root of a depth first spanning tree (English)
0 references
1986
0 references
parallel computation
0 references
depth first spanning tree
0 references
root-shifting problem
0 references
