📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Round Compression for Parallel Matching Algorithms (2017)

First Author: Czumaj A

Attributed to: Sublinear Algorithms for Big Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1707.03478

Publication URI: https://arxiv.org/abs/1707.03478

Type: Preprint