- Alternative title
-
Network Visualization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Bibliographic citation
-
In: it - Information Technology ; 46 (2004), 3. - S. 129-134
- Classification
-
Mathematik
- Keyword
-
Netzwerk
Visualisierung
Knoten
Graphenzeichnen
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2008
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-72149
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 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
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Time of origin
- 2008
Other Objects (12)
Dynamic Grid Embedding with Few Bends and Changes
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Ü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 (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Bayesian Paradigm for Dynamic Graph Layout
Centrality in Policy Network Drawings : (Extended Abstract)
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
Social networks
Dynamic Grid Embedding with Few Bends and Changes
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Ü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 (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Bayesian Paradigm for Dynamic Graph Layout
Centrality in Policy Network Drawings : (Extended Abstract)
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
Social networks
Dynamic Grid Embedding with Few Bends and Changes
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Ü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 (Extended Abstract)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
A Bayesian Paradigm for Dynamic Graph Layout
Centrality in Policy Network Drawings : (Extended Abstract)
Generating Node Coordinates for Shortest-Path Computations in Transportation Networks
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles