KOPS - Das Institutionelle Repositorium der Universität Konstanz

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:21d37d2cca4a0a63273fc915cfd45c3f

BRANDES, Ulrik, Dorothea WAGNER, 1997. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). In: BURKARD, Rainer, ed.. Algorithms - ESA '97 : 5th annual European symposium, Graz, Austria, September 15 - 17, 1997 ; proceedings. Berlin [u.a.]:Springer, pp. 64-77. ISBN 3-540-63397-9

@inproceedings{Brandes1997Linea-5701, title={A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)}, year={1997}, number={1284}, isbn={3-540-63397-9}, address={Berlin [u.a.]}, publisher={Springer}, series={Lecture notes in computer science}, booktitle={Algorithms - ESA '97 : 5th annual European symposium, Graz, Austria, September 15 - 17, 1997 ; proceedings}, pages={64--77}, editor={Burkard, Rainer}, 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/5701"> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:rights>deposit-license</dc:rights> <dc:language>eng</dc:language> <dcterms:issued>1997</dcterms:issued> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5701"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:27Z</dcterms:available> <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> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:title>A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:27Z</dc:date> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 5th European Symposium Algorithms (ESA ´97) (LNCS 1284), 1997, pp. 64-77</dcterms:bibliographicCitation> <dc:format>application/pdf</dc:format> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Brandes, Ulrik</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bw_ltaad_97.pdf 87

Das Dokument erscheint in:

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

KOPS Suche


Stöbern

Mein Benutzerkonto