- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Graph Drawing / Pach, János (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3383). - S. 43-48. - ISBN 978-3-540-24528-5
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-77170
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
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
- Baur, Michael
- Brandes, Ulrik
- Gaertler, Marco
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (12)
Über das Zeichnen von Graphen
Random Field Models for Graph Layout
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Dynamic Grid Embedding with Few Bends and Changes
A Bayesian Paradigm for Dynamic Graph Layout
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Sketch-Driven Orthogonal Graph Drawing
Netzwerkvisualisierung
Experiments on Graph Clustering Algorithms
Engineering Graph Clustering : Models and Experimental Evaluation
Über das Zeichnen von Graphen
Random Field Models for Graph Layout
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Dynamic Grid Embedding with Few Bends and Changes
A Bayesian Paradigm for Dynamic Graph Layout
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Sketch-Driven Orthogonal Graph Drawing
Netzwerkvisualisierung
Experiments on Graph Clustering Algorithms
Engineering Graph Clustering : Models and Experimental Evaluation
Über das Zeichnen von Graphen
Random Field Models for Graph Layout
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Dynamic Grid Embedding with Few Bends and Changes
A Bayesian Paradigm for Dynamic Graph Layout
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Sketch-Driven Orthogonal Graph Drawing
Netzwerkvisualisierung
Experiments on Graph Clustering Algorithms