Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
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.
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000