Sciweavers

3708 search results - page 1 / 742
» Approximating Betweenness Centrality
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
13 years 10 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 3 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
ALENEX
2008
131views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Better Approximation of Betweenness Centrality
Robert Geisberger, Peter Sanders, Dominik Schultes
STACS
2005
Springer
13 years 10 months 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
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 4 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali