Finding Euler tours in parallel (Q801686)
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: Finding Euler tours in parallel |
scientific article; zbMATH DE number 3880128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Euler tours in parallel |
scientific article; zbMATH DE number 3880128 |
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
0.7860973477363586
0 references
0.7827658653259277
0 references
0.7824739217758179
0 references
