- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Graph Drawing / Eppstein, David; Gansner, Emden R. (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. - (Lecture Notes in Computer Science ; 5849). - S. 159-170. - ISBN 978-3-642-11804-3
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2010
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-131223
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 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
- Baur-Badent, Melanie
- Baur, Michael
- Brandes, Ulrik
- Cornelsen, Sabine
- Bibliothek der Universität Konstanz
Time of origin
- 2010
Other Objects (12)
More canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
A Faster Algorithm for Betweenness Centrality
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives
Network positions
More canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
A Faster Algorithm for Betweenness Centrality
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives
Network positions
More canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
A Faster Algorithm for Betweenness Centrality
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives