KAIS

2011

12 years 9 months ago
2011

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 coeﬃcie...

GRC

2008

IEEE

13 years 3 months ago
2008

IEEE

Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artiﬁcial networks. However, these approaches have not factored...

AAAI

2007

13 years 4 months ago
2007

Complex networks exist in a wide array of diverse domains, ranging from biology, sociology, and computer science. These real-world networks, while disparate in nature, often compr...

ACMSE

2005

ACM

13 years 8 months ago
2005

ACM

Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...

WAW

2007

Springer

13 years 8 months ago
2007

Springer

A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...

PKDD

2007

Springer

13 years 8 months ago
2007

Springer

Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...

ICPR

2008

IEEE

13 years 9 months ago
2008

IEEE

Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...

COMPLEX

2009

Springer

13 years 9 months ago
2009

Springer

Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...