Fully Dynamic Orthogonal Graph Layout for Interactive Systems

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Fully Dynamic Orthogonal Graph Layout for Interactive Systems ; 111
Konstanzer Schriften in Mathematik und Informatik ; 111

Classification: Informatik

Creator: Brandes, Ulrik
Güdemann, Michael
Wagner, Dorothea

URN: urn:nbn:de:bsz:352-opus-20865

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:57 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Brandes, Ulrik
Güdemann, Michael
Wagner, Dorothea

Other Objects (12)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

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

Über das Zeichnen von Graphen

A Bayesian Paradigm for Dynamic 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

Netzwerkvisualisierung

Sketch-Driven Orthogonal Graph Drawing

Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles

Social networks

Centrality in Policy Network Drawings : (Extended Abstract)

Related objects

Reset password