- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Notes
-
In: Graph Drawing / Goodrich, Michael T.; Kobourov, Stephen G. (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. - (Lecture Notes in Computer Science ; 2528). - S. 1-11. - ISBN 978-3-540-00158-4
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2009
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-73474
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:48 PM CET
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
- Eiglsperger, Markus
- Kaufmann, Michael
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Time of origin
- 2009
Other Objects (12)
On the hardness of orthogonal-order preserving graph drawing
Graph drawing by classical multidimensional scaling : new perspectives
Layout of Graph Visualizations
Layout of graph visualizations
Orthogonal-Ordering Constraints are Tough
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
Drawing Phylogenetic Trees : (Extended Abstract)
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword
A Faster Algorithm for Betweenness Centrality
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
On the hardness of orthogonal-order preserving graph drawing
Graph drawing by classical multidimensional scaling : new perspectives
Layout of Graph Visualizations
Layout of graph visualizations
Orthogonal-Ordering Constraints are Tough
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
Drawing Phylogenetic Trees : (Extended Abstract)
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword
A Faster Algorithm for Betweenness Centrality
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
On the hardness of orthogonal-order preserving graph drawing
Graph drawing by classical multidimensional scaling : new perspectives
Layout of Graph Visualizations
Layout of graph visualizations
Orthogonal-Ordering Constraints are Tough
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
Drawing Phylogenetic Trees : (Extended Abstract)
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword
A Faster Algorithm for Betweenness Centrality
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B