Efficient parallel graph algorithms for coarse grained multicomputers and BSP
From MaRDI portal
Publication:4571970
DOI10.1007/3-540-63165-8_195zbMath1401.68355OpenAlexW1522694128MaRDI QIDQ4571970
Frank Dehne, Alessandro Roncato, Ingo Rieping, Siang W. Song, Paola Flocchini, Nicola Santoro, Afonso G. Ferreira, E. N. Cáceres
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_195
Related Items (3)
Efficient parallel graph algorithms for coarse grained multicomputers and BSP ⋮ 1-optimality of static BSP computations: Scheduling independent chains as a case study. ⋮ PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized parallel list ranking for distributed memory multiprocessors.
- On rigid circuit graphs
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
- An Efficient Parallel Biconnectivity Algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel Merge Sort
- An O(logn) parallel connectivity algorithm
- Algorithmic Aspects of Vertex Elimination on Graphs
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Direct bulk-synchronous parallel algorithms
- SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
This page was built for publication: Efficient parallel graph algorithms for coarse grained multicomputers and BSP