Network Analysis
From MaRDI portal
Publication:5703979
DOI10.1007/b106453zbMath1118.68326MaRDI QIDQ5703979
Dirk Koschützki, Dagmar Tenfelde-Podehl, Riko Jacob, Leon Peeters, 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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, Finding groups with maximum betweenness centrality via integer programming with random path sampling, On resilient graph spanners, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Snapshot centrality indices in dynamic FIFO networks, Fast approximation of betweenness centrality through sampling, A local average connectivity-based method for identifying essential proteins from the network level, Efficient Computation of Time-Dependent Centralities in Air Transportation Networks