3 citations · 5 across the 10 of their papers we have counts for
4 papers · 1 filter
Algorithms and Hardness for Diameter in Dynamic Graphs
Bertie Ancona, Monika Henzinger, Liam Roditty +2
The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the…
Fully Dynamic MIS in Uniformly Sparse Graphs
Krzysztof Onak, Baruch Schieber, Shay Solomon +1
We consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (ST…
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
Arturs Backurs, Liam Roditty, Gilad Segal +2
Among the most important graph parameters is the Diameter, the largest distance between any two vertices. There are no known very efficient algorithms for computing the Diameter ex…
Finding Cliques in Social Networks: A New Distribution-Free Model
Jacob Fox, Tim Roughgarden, C. Seshadhri +2
We propose a new distribution-free model of social networks. Our definitions are motivated by one of the most universal signatures of social networks, triadic closure---the propert…