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

to connected 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: 25.03.2025, 1:45 PM CET

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 (Extended Abstract)

A Faster Algorithm for Betweenness Centrality

Hochschulschrift

Layout of graph visualizations

Hochschulschrift | Online-Publikation

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 (Extended Abstract)

A Faster Algorithm for Betweenness Centrality

Hochschulschrift

Layout of graph visualizations

Hochschulschrift | Online-Publikation

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 (Extended Abstract)

A Faster Algorithm for Betweenness Centrality

Hochschulschrift

Layout of graph visualizations

Hochschulschrift | Online-Publikation

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

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 (Extended Abstract)

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 (Extended Abstract)

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 (Extended Abstract)

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

Related objects

Reset password