📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Round compression for parallel matching algorithms (2018)

First Author: Diakonikolas I

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/3188745.3188764

Publication URI: http://dx.doi.org/10.1145/3188745.3188764

Type: Conference/Paper/Proceeding/Abstract