Geometric spanners in the MapReduce model

DOI10.1007/978-3-319-94776-1_56MaRDI QIDQ1791036zbMATH OpenOpenAlexFDO

Authors Sepideh Aghamolaei, F. Baharifard, Mohammad Ghodsi

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_56

zbMATH Keywords

computational geometryparallel computationMapReducegeometric spanners

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Parallel algorithms for geometric graph problems
• STACS 2005
• scientific article; zbMATH DE number 1617269
• On Spanners of Geometric Graphs

Cited in

(2)

• Parallel algorithms for geometric graph problems
• Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality

This page was built for publication: Geometric spanners in the MapReduce model

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