A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Algorithms - ESA '97 : 5th annual European symposium, Graz, Austria, September 15 - 17, 1997 ; proceedings / Burkard, Rainer (Hrsg.). - Berlin [u.a.] : Springer, 1997. - (Lecture notes in computer science ; 1284). - S. 64-77. - ISBN 3-540-63397-9
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2009
- Creator
- URN
-
urn:nbn:de:bsz:352-opus-73456
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 PM CET
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
- 2009
Other Objects (12)
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Faster Algorithm for Betweenness Centrality
Layout of graph visualizations
Layout of Graph Visualizations
Efficient orbit-aware triad and quad census in directed and undirected graphs
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Eager st-Ordering
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives
Network positions
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Faster Algorithm for Betweenness Centrality
Layout of graph visualizations
Layout of Graph Visualizations
Efficient orbit-aware triad and quad census in directed and undirected graphs
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Eager st-Ordering
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives
Network positions
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Faster Algorithm for Betweenness Centrality
Layout of graph visualizations
Layout of Graph Visualizations
Efficient orbit-aware triad and quad census in directed and undirected graphs
Optimal Leaf Ordering of Complete Binary Trees
Hunting Down Graph B
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Eager st-Ordering
Markoff-Felder als Hilfsmittel der Bildverarbeitung
Graph drawing by classical multidimensional scaling : new perspectives