Finding Euler tours in parallel (Q801686): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Euler tours in parallel |
scientific article |
Statements
Finding Euler tours in parallel (English)
0 references
1984
0 references
The problem of finding Euler tours in directed and undirected Euler graphs is considered. O(log\(| V|)\) time algorithms are given using a linear number of processors on a concurrent-read concurrent-write parallel RAM.
0 references
parallel computation
0 references
parallel algorithms
0 references
Euler tours
0 references
Euler graphs
0 references
concurrent-read concurrent-write parallel RAM
0 references
