- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Graph Drawing / Kaufmann, Michael; Wagner, Dorothea (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2007. - (Lecture Notes in Computer Science). - S. 54-65. - ISBN 978-3-540-70903-9
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2009
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-77803
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 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
- Schlieper, Barbara
- Bibliothek der Universität Konstanz
Time of origin
- 2009
Other Objects (12)
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
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
Orthogonal-Ordering Constraints are Tough
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
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
Orthogonal-Ordering Constraints are Tough
Communicating centrality in policy network drawings
Centrality in Policy Network Drawings : (Extended Abstract)
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