most citedOn the Complexity of the -Anonymization Problem

6 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2012

Distributed Algorithms for Scheduling on Line and Tree Networks

Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal

We have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a dem…