156 search results - page 21 / 32 » Structure of Neighborhoods in a Large Social Network |
102
click to vote
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
APJOR
2010
14 years 12 months ago
2010
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
109
click to vote
JAIR
2008
14 years 11 months ago
2008
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...