Sciweavers

1095 search results - page 5 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
ICCCN
2008
IEEE
14 years 1 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
PODC
2011
ACM
12 years 10 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
STACS
2005
Springer
14 years 26 days ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
13 years 11 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 9 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...