A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms

Counting the number of triangles in a large graph has many important applications in network analysis. Several frequently computed metrics such as the clustering coefficient and the transitivity ratio need to count the number of triangles. In this paper, we present a randomized framework for express...

Celý popis

Podrobná bibliografie

Vydáno v:	2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA) s. 80 - 89
Hlavní autor:	Chehreghani, Mostafa Haghir
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.10.2016
Témata:	Algorithm design and analysis approximate algorithms Approximation algorithms Clustering algorithms Correlation Eigenvalues and eigenfunctions Graphs large network analysis Probability distribution Time complexity triangle counting
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!