KOPS - Das Institutionelle Repositorium der Universität Konstanz

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

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:4226ba31e56fbf93d4e028b81fcfbed9

BRANDES, Ulrik, Dorothea WAGNER, 1997. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

@unpublished{Brandes1997Linea-6203, title={A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs}, year={1997}, author={Brandes, Ulrik and Wagner, Dorothea} }

1997 deposit-license A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs Brandes, Ulrik 2011-03-24T16:10:09Z 2011-03-24T16:10:09Z Given a graph G=(V,E) and two different vertices s,t in V, the Menger problem is to find a maximum number of disjoint paths connecting s and t. Depending on whether the input graph is directed or not, and what kind of disjointness criterion is demanded, this general formulation is specialized to the directed or undirected vertex, and the edge or arc disjoint Menger problem, respectively.<br /><br /><br /><br />For planar graphs the edge disjoint Menger problem has been solved to optimality, while the fastest algorithm for the arc disjoint version is Weihe's general maximum flow algorithm for planar networks, which has running time O(|V|log|V|). Here we present a linear time, i.e. asymptotically optimal, algorithm for the arc disjoint version in planar directed graphs. Wagner, Dorothea application/pdf Brandes, Ulrik eng Wagner, Dorothea

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_029.pdf 75

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto