828 search results - page 61 / 166 » Simplicial Powers of Graphs |
KDD
2004
ACM
14 years 2 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
AMAI
2000
Springer
14 years 1 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...