11 citations · 27 across the 9 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DC2011★ 11 cited
Information Spreading in Dynamic Networks
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman +1
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, -gossip, there are pieces of information…
cs.DS2011
On Strong Graph Partitions and Universal Steiner Trees
Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan +2
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph and a root node , we seek a single spanning tree of minimum {\em stretc…