- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Anmerkungen
-
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
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-73474
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:48 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
- Eiglsperger, Markus
- Kaufmann, Michael
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (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