Sciweavers

322 search results - page 18 / 65
» Structural and algorithmic aspects of massive social network...
Sort
View
CIDM
2007
IEEE
15 years 4 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
MOBIHOC
2009
ACM
15 years 10 months ago
Multicasting in delay tolerant networks: a social network perspective
Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used ...
Wei Gao, Qinghua Li, Bo Zhao, Guohong Cao
80
Voted
EPIA
2009
Springer
15 years 4 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
86
Voted
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 3 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
83
Voted
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
15 years 10 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...