- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Journal of Mathematical Sociology ; 25 (2001), 2. - S. 163-177
- Klassifikation
-
Sozialwissenschaften, Soziologie, Anthropologie
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-71888
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 MEZ
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
- Brandes, Ulrik
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (12)
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Centrality Estimation in Large Networks
Layout of graph visualizations
Layout of Graph Visualizations
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Centrality as a predictor of lethal proteins : performance and robustness
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Maintaining the duality of closeness and betweenness centrality
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Centrality Estimation in Large Networks
Layout of graph visualizations
Layout of Graph Visualizations
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Centrality as a predictor of lethal proteins : performance and robustness
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Maintaining the duality of closeness and betweenness centrality
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Centrality Estimation in Large Networks
Layout of graph visualizations
Layout of Graph Visualizations
Re-conceptualizing centrality in social networks
Centrality Measures Based on Current Flow
Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Centrality as a predictor of lethal proteins : performance and robustness
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs