Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (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.1137/20m1366502
Publication URI: http://dx.doi.org/10.1137/20m1366502
Type: Journal Article/Review
Parent Publication: SIAM Journal on Computing
Issue: 5