A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithmica ; 28 (2000), 1. - S. 16-36
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-72154
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 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
- Brandes, Ulrik
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (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