9 citations · 25 across the 8 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2021
The Complexity of Symmetry Breaking in Massive Graphs
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz +1
The goal of this paper is to understand the complexity of symmetry breaking problems, specifically maximal independent set (MIS) and the closely related -ruling set problem, in…
cs.DC2018
Detecting cliques in CONGEST networks
Artur Czumaj, Christian Konrad
The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given…
cs.DC2018
MIS in the Congested Clique Model in Rounds
Christian Konrad
We give a maximal independent set (MIS) algorithm that runs in rounds in the congested clique model, where is the maximum degree of the input graph. This impro…