13 citations · 38 across the 29 of their papers we have counts for
3 papers · 1 filter
Finding Connected Secluded Subgraphs
Petr A. Golovach, Pinar Heggernes, Paloma Lima +1
Problems related to finding induced subgraphs satisfying given properties form one of the most studied areas within graph algorithms. Such problems have given rise to breakthrough…
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…