3 citations · 3 across the 1 of their papers we have counts for
1 paper
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…