828 search results - page 65 / 166 » Simplicial Powers of Graphs |
SPAA
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...