Counting Stars and Other Small Subgraphs in Sublinear-Time

Detecting and counting the number of copies of certain subgraphs (also known as network motifs or 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 th...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on discrete mathematics Vol. 25; no. 3; pp. 1365 - 1411
Main Authors:	Gonen, Mira, Ron, Dana, Shavitt, Yuval
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Subjects:	Algorithms Approximation Electrical engineering Graphs Queries World Wide Web
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!