A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: Algorithmica ; 28 (2000), 1. - S. 16-36

Classification: Mathematik

Event: Veröffentlichung

(where): Konstanz

(who): Bibliothek der Universität Konstanz

(when): 2009

Creator: Brandes, Ulrik
Wagner, Dorothea

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

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

Last update: 14.08.2025, 10:51 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
Wagner, Dorothea
Bibliothek der Universität Konstanz

Time of origin

2009

Other Objects (12)

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

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.

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

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)

Dynamic Grid Embedding with Few Bends and Changes

Über das Zeichnen von Graphen

Random Field Models for Graph Layout

Fully Dynamic Orthogonal Graph Layout for Interactive Systems

A Bayesian Paradigm for Dynamic Graph Layout

Netzwerkvisualisierung

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)

Wiring Edge-Disjoint Layouts

How to draw the minimum cuts of a planar graph

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

Related objects

Reset password