14 citations · 19 across the 5 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2016
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien +3
Growing interest in modeling large, complex networks has spurred significant research into generative graph models. Kronecker-style models (SKG and R-MAT) are often used due to the…
cs.SI2014★ 3 cited
Hyperbolicity, degeneracy, and expansion of random intersection graphs
Matthew Farrell, Timothy Goodrich, Nathan Lemons +3
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks wh…