Sciweavers

315 search results - page 1 / 63
» Better Approximation of Betweenness Centrality
Sort
View
ALENEX
2008
131views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Better Approximation of Betweenness Centrality
Robert Geisberger, Peter Sanders, Dominik Schultes
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
13 years 11 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
TEDU
2011
163views Education» more  TEDU 2011»
12 years 11 months ago
Tangible Interfaces to Digital Connections, Centralized versus Decentralized
In the era of distributed digital media, technology is moving to the background and interoperability between devices increases. The handles for users to explore, make and break con...
Matthijs Kwak, Gerrit Niezen, Bram van der Vlist, ...
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