Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space (2021)
Attributed to:
Sublinear Algorithms for Big Graphs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1145/3451992
Publication URI: http://dx.doi.org/10.1145/3451992
Type: Journal Article/Review
Parent Publication: ACM Transactions on Algorithms
Issue: 2