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

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on discrete mathematics Ročník 25; číslo 3; s. 1365 - 1411
Hlavní autori:	Gonen, Mira, Ron, Dana, Shavitt, Yuval
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2011
Predmet:	Algorithms Approximation Electrical engineering Graphs Queries World Wide Web
ISSN:	0895-4801, 1095-7146
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!