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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics Jg. 25; H. 3; S. 1365 - 1411
Hauptverfasser:	Gonen, Mira, Ron, Dana, Shavitt, Yuval
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Schlagworte:	Algorithms Approximation Electrical engineering Graphs Queries World Wide Web
ISSN:	0895-4801, 1095-7146
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!