Finding Euler tours in parallel (Q801686): 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/0022-0000(84)90003-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4210697874 / rank | |||
Normal rank |
Revision as of 00:49, 20 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