Sciweavers

41 search results - page 1 / 9
» Counting triangles in real-world networks using projections
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
WWW
2011
ACM
13 years 1 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
IPSN
2010
Springer
14 years 1 months ago
Multichannel reliability assessment in real world WSNs
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
Jorge Ortiz, David E. Culler
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 6 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 1 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda