Binary tree algebraic computation and parallel algorithms for simple graphs

DOI10.1016/0196-6774(88)90007-7zbMath0647.68067OpenAlexW2002171526MaRDI QIDQ3792255

Xin He, Yaacov Yesha

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90007-7

zbMATH Keywords

binary treealgebraic computationefficient parallel algorithmexclusive write PRAMtwo terminal series parallel

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Optimal parallel colouring algorithms for totally decomposable graphs ⋮ NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems ⋮ Efficiently parallelizable problems on a class of decomposable graphs ⋮ Efficient parallel algorithms for r-dominating set and p-center problems on trees ⋮ Optimal parallel quicksort on EREW PRAM ⋮ A note on the tour problems in two-terminal series-parallel graphs

This page was built for publication: Binary tree algebraic computation and parallel algorithms for simple graphs