Solving tree problems on a mesh-connected processor array

DOI10.1016/S0019-9958(86)80046-8zbMath0605.68058MaRDI QIDQ3742734

Susanne E. Hambrusch, Mikhail J. Atallah

Publication date: 1986

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

asymptotically optimal algorithms

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

List-ranking on interconnection networks. ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Topological numbering of features on a mesh ⋮ Randomized parallel list ranking for distributed memory multiprocessors. ⋮ Determining maximum \(k\)-width-connectivity on meshes

This page was built for publication: Solving tree problems on a mesh-connected processor array