5 citations · 23 across the 20 of their papers we have counts for
3 papers · 1 filter
Distributed Subgraph Detection
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti +2
In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume larg…
Graph Reconstruction in the Congested Clique
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport +1
The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of nodes. In this paper we con…
On the heapability of finite partial orders
János Balogh, Cosmin Bonchiş, Diana Diniş +2
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, whic…