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