A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
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
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-73456
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:54 MEZ
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 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