Finding Euler tours in parallel (Q801686): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sorting in \(c \log n\) parallel steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(logn) parallel connectivity algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The VLSI Complexity of Sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implementation of simultaneous memory address access in models that forbid it / rank | |||
Normal rank |
Latest revision as of 16:12, 14 June 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