Brief announcement: MapReduce algorithms for massive trees
From MaRDI portal
(Redirected from Brief announcement: MapReduce algorithms for massive trees)
Recommendations
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
- Efficient massively parallel methods for dynamic programming
- scientific article; zbMATH DE number 6297759
- Efficient primal-dual graph algorithms for MapReduce
- Distributed computation of large-scale graph problems
Cites work
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Parallel algorithms for geometric graph problems
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Sorting, searching, and simulation in the MapReduce framework
- Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
Cited in
(6)- Equivalence classes and conditional hardness in massively parallel computations
- Efficient primal-dual graph algorithms for MapReduce
- Efficient massively parallel methods for dynamic programming
- Streaming and massively parallel algorithms for edge coloring
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond
- Exponentially faster massively parallel maximal matching
This page was built for publication: Brief announcement: MapReduce algorithms for massive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002852)
