Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Mira Gonen:

TR09-083 | 24th September 2009
Dana Ron, Mira Gonen, Yuval Shavitt

Counting Stars and Other Small Subgraphs in Sublinear Time

Detecting and counting the number of copies of certain subgraphs (also known as {\em network motifs\/} or {\em graphlets\/}), is motivated by applications in a variety of areas ranging from Biology to the study of the World-Wide-Web. Several polynomial-time algorithms have been suggested for counting or detecting the number of ... more >>>

ISSN 1433-8092 | Imprint