Sciweavers

35 search results - page 1 / 7
» Ranking of Closeness Centrality for Large-Scale Social Netwo...
Sort
View
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 6 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
ICPP
2006
IEEE
13 years 10 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
DBKDA
2010
IEEE
127views Database» more  DBKDA 2010»
13 years 3 months ago
Failure-Tolerant Transaction Routing at Large Scale
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...
INFOCOM
2010
IEEE
13 years 3 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
13 years 10 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