Approximately Counting Cliques
Lars Eilstrup Rasmussen
EECS Department, University of California, Berkeley
Technical Report No. UCB/CSD-96-910
, 1996
http://www2.eecs.berkeley.edu/Pubs/TechRpts/1996/CSD-96-910.pdf
We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph.
BibTeX citation:
@techreport{Rasmussen:CSD-96-910, Author= {Rasmussen, Lars Eilstrup}, Title= {Approximately Counting Cliques}, Year= {1996}, Month= {Aug}, Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1996/5282.html}, Number= {UCB/CSD-96-910}, Abstract= {We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph.}, }
EndNote citation:
%0 Report %A Rasmussen, Lars Eilstrup %T Approximately Counting Cliques %I EECS Department, University of California, Berkeley %D 1996 %@ UCB/CSD-96-910 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1996/5282.html %F Rasmussen:CSD-96-910