Successive approximation in parallel graph algorithms (extended abstract)

DOI10.1007/BFB0028985MaRDI QIDQ5096155zbMATH OpenOpenAlexFDO

Authors Donald S. Fussell, Ramakrishna Thurimella

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0028985

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Successive approximation in parallel graph algorithms
• scientific article; zbMATH DE number 4155927
• Efficient parallel graph algorithms based on open ear decomposition
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Parallel search algorithms for graphs and trees

Cites work

• An Efficient Parallel Biconnectivity Algorithm
• An O(logn) parallel connectivity algorithm
• scientific article; zbMATH DE number 3876584 (Why is no real title available?)
• scientific article; zbMATH DE number 4064512 (Why is no real title available?)
• Parallel ear decomposition search (EDS) and st-numbering in graphs

Cited in

(3)

• scientific article; zbMATH DE number 4155927 (Why is no real title available?)
• scientific article; zbMATH DE number 4087453 (Why is no real title available?)
• Successive approximation in parallel graph algorithms

This page was built for publication: Successive approximation in parallel graph algorithms (extended abstract)

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