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:e6ccdf4393ec7be0c0ff92904f8088d8

BRANDES, Ulrik, Dorothea WAGNER, 2000. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. In: Algorithmica. 28(1), pp. 16-36

@article{Brandes2000Linea-5897, title={A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs}, year={2000}, doi={10.1007/s004530010029}, number={1}, volume={28}, journal={Algorithmica}, pages={16--36}, author={Brandes, Ulrik and Wagner, Dorothea} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5897"> <dcterms:abstract xml:lang="eng">Given a graph G = (V, E) and two vertices s, t belong to V, s unequal to t, 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. For planar graphs the edge disjoint Menger problem has been solved to optimality [W2], while the fastest algorithm for the arc disjoint version is Weihe s general maximum flow algorithm for planar networks [W1], which has running time O (abs(V) log abs(V)). Here we present a linear time, i.e., asymptotically optimal, algorithm for the arc disjoint version in planar directed graphs.</dcterms:abstract> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dcterms:issued>2000</dcterms:issued> <dcterms:title>A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:13Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dcterms:bibliographicCitation>First publ. in: Algorithmica ; 28 (2000), 1. - S. 16-36</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dc:format>application/pdf</dc:format> <dc:creator>Wagner, Dorothea</dc:creator> <dc:creator>Brandes, Ulrik</dc:creator> <dc:contributor>Brandes, Ulrik</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5897"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:13Z</dc:date> <dc:contributor>Wagner, Dorothea</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

fulltext.pdf 71

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto