AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Parallel Algorithms
About this Title
Sandeep N. Bhatt, Editor
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1997; Volume 30
ISBNs: 978-0-8218-0447-6 (print); 978-1-4704-3988-0 (online)
DOI: https://doi.org/10.1090/dimacs/030
MathSciNet review: MR1442038
MSC: Primary 68Q22; Secondary 68-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Connected components on distributed memory machines
- Parallel implementation of algorithms for finding connected components in graphs
- Connected components algorithms for mesh-connected parallel computers
- Implementing parallel shortest-paths algorithms
- Finding friends-of-friends clusters quickly
- A practical comparison of $N$-body algorithms
- Parallel algorithms for geometric dominance problems
- The $\star $Socrates massively parallel chess program
- Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms