- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Faster Evaluation of Shortest-Path Based Centrality Indices ; 120
Konstanzer Schriften in Mathematik und Informatik ; 120
- Classification
-
Informatik
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-20917
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:04 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
Other Objects (12)
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Centrality Estimation in Large Networks
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Layout of graph visualizations
Eager st-Ordering
Layout of Graph Visualizations
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Centrality as a predictor of lethal proteins : performance and robustness
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Centrality Estimation in Large Networks
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Layout of graph visualizations
Eager st-Ordering
Layout of Graph Visualizations
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Centrality as a predictor of lethal proteins : performance and robustness
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Centrality Estimation in Large Networks
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Layout of graph visualizations
Eager st-Ordering
Layout of Graph Visualizations
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent