Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
This paper presents a new space-efficient algorithm for counting and sampling triangles-and more generally, constant-sized cliques-in a massive graph whose edges arrive as a stream. Compared to prior work, our algorithm yields significant improvements in the space and time complexity for these fundamental problems. Our algorithm is simple to implement and has very good practical performance on large graphs. © 2013 VLDB Endowment.
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Nanda Kambhatla
ACL 2004
Thomas M. Cover
IEEE Trans. Inf. Theory
Eric Price, David P. Woodruff
FOCS 2011