Finding Euler tours in parallel
type: Item
instance of: scholarly article
title: Finding Euler tours in parallel
zbMATH Open document ID: 0552.68060
DOI: 10.1016/0022-0000(84)90003-5
author: Mikhail J. Atallah
author: Uzi Vishkin
published in: Journal of Computer and System Sciences
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 3880128
zbMATH Keywords: parallel computation
zbMATH Keywords: parallel algorithms
zbMATH Keywords: Euler tours
zbMATH Keywords: Euler graphs
zbMATH Keywords: concurrent-read concurrent-write parallel RAM
MaRDI profile type: Publication
full work available at URL: 0022-0000(84)90003-5
OpenAlex ID: W4210697874
cites work: Sorting in \(c \log n\) parallel steps
cites work: Q3883524
cites work: An O(logn) parallel connectivity algorithm
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: The VLSI Complexity of Sorting
cites work: Implementation of simultaneous memory address access in models that forbid it
description: scientific article; zbMATH DE number 3880128