Binary tree algebraic computation and parallel algorithms for simple graphs

DOI10.1016/0196-6774(88)90007-7MaRDI QIDQ3792255zbMATH OpenOpenAlexFDO

Authors 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

algebraic computationbinary treeefficient parallel algorithmexclusive write PRAMtwo terminal series parallel

Mathematics Subject Classification ID

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

Recommendations

• Graph algorithms on a tree-structured parallel computer
• scientific article; zbMATH DE number 4068310
• Parallel recognition and decomposition of two terminal series parallel graphs
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Parallel computation of matchings in trees

Cited in

(8)

• Efficient parallel algorithms for r-dominating set and p-center problems on trees
• A note on the tour problems in two-terminal series-parallel graphs
• A geometric algebra implementation using binary tree
• Efficiently parallelizable problems on a class of decomposable graphs
• Optimal parallel colouring algorithms for totally decomposable graphs
• scientific article; zbMATH DE number 1555968 (Why is no real title available?)
• NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
• Optimal parallel quicksort on EREW PRAM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792255)