- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: IEEE Transactions on Knowledge and Data Engineering ; 20 (2008), 2. - S. 172-188
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2011
- Contributor
-
Brandes, Ulrik
Delling, Daniel
Gaertler, Marco
Görke, Robert
Hoefer, Martin
Nikoloski, Zoran
Wagner, Dorothea
- URN
-
urn:nbn:de:bsz:352-opus-71790
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 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
- Brandes, Ulrik
- Delling, Daniel
- Gaertler, Marco
- Görke, Robert
- Hoefer, Martin
- Nikoloski, Zoran
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Time of origin
- 2011
Other Objects (12)
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
Experiments on Graph Clustering Algorithms
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Adaptive Disentanglement based on Local Clustering in Small-World Network Visualization
Network analysis : methodological foundations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Eager st-Ordering
Dynamic Grid Embedding with Few Bends and Changes
A Faster Algorithm for Betweenness Centrality
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
Experiments on Graph Clustering Algorithms
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Adaptive Disentanglement based on Local Clustering in Small-World Network Visualization
Network analysis : methodological foundations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Eager st-Ordering
Dynamic Grid Embedding with Few Bends and Changes
A Faster Algorithm for Betweenness Centrality
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
Experiments on Graph Clustering Algorithms
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Adaptive Disentanglement based on Local Clustering in Small-World Network Visualization
Network analysis : methodological foundations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Eager st-Ordering
Dynamic Grid Embedding with Few Bends and Changes