A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs ; 29
Konstanzer Schriften in Mathematik und Informatik ; 29
- Classification
-
Informatik
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-20217
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:46 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
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
Netzwerkvisualisierung
A Bayesian Paradigm for Dynamic Graph Layout
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
Centrality in Policy Network Drawings : (Extended Abstract)
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
Netzwerkvisualisierung
A Bayesian Paradigm for Dynamic Graph Layout
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
Centrality in Policy Network Drawings : (Extended Abstract)
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
Netzwerkvisualisierung
A Bayesian Paradigm for Dynamic Graph Layout
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