Chapter 4. Algorithms for centrality indices

DOI10.1007/978-3-540-31955-9_4MaRDI QIDQ5703979zbMATH OpenOpenAlexFDO

Authors Riko Jacob, Dirk Koschützki, Leon Peeters, Dagmar Tenfelde-Podehl, Katharina A. Zweig

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106453

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Centrality measures based on current flow
• Chapter 3. Centrality indices
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Approximating Betweenness Centrality
• Approximating betweenness centrality in large evolving networks

Cited in

(21)

• Fast approximation of betweenness centrality through sampling
• A local average connectivity-based method for identifying essential proteins from the network level
• A faster algorithm for betweenness centrality*
• Positional dominance: concepts and algorithms
• Efficient computation of time-dependent centralities in air transportation networks
• Complex graph algorithms
• Large-scale network analysis
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Fast Approximation of Centrality
• Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
• Scalable Katz ranking computation in large static and dynamic graphs
• Subcubic equivalences between graph centrality problems, APSP and diameter
• Chapter 3. Centrality indices
• Chapter 5. Advanced centrality concepts
• Centrality measures based on current flow
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques
• Finding groups with maximum betweenness centrality via integer programming with random path sampling
• New seeding strategies for the influence maximization problem
• Snapshot centrality indices in dynamic FIFO networks

This page was built for publication: Chapter 4. Algorithms for centrality indices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703979)