5 citations · 23 across the 20 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 4 cited
On Distance- Independent Set and other problems in graphs with few minimal separators
Pedro Montealegre, Ioan Todinca
Fomin and Villanger (STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most…
cs.DC2016★ 1 cited
Distributed Testing of Excluded Subgraphs
Pierre Fraigniaud, Ivan Rapaport, Ville Salo +1
We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a con…
cs.DC2016★ 4 cited
Deterministic graph connectivity in the broadcast congested clique
Pedro Montealegre, Ioan Todinca
We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the nodes of a graph receives a row of the adjacency matrix, and…