- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Faster Evaluation of Shortest-Path Based Centrality Indices ; 120
Konstanzer Schriften in Mathematik und Informatik ; 120
- Klassifikation
-
Informatik
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-20917
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:04 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
Ähnliche Objekte (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
Centrality Measures Based on Current Flow
Re-conceptualizing centrality in social networks
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
Centrality Measures Based on Current Flow
Re-conceptualizing centrality in social networks
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
Centrality Measures Based on Current Flow
Re-conceptualizing centrality in social networks
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