A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
| Type of Publication: | Journal article |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-72154 |
| Author: | Brandes, Ulrik; Wagner, Dorothea |
| Year of publication: | 2000 |
| Published in: | Algorithmica ; 28 (2000), 1. - pp. 16-36 |
| DOI (citable link): | https://dx.doi.org/10.1007/s004530010029 |
| Summary: |
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.
|
| Subject (DDC): | 004 Computer Science |
| Keywords: | graph algorithms, disjoint paths, planar graphs |
| Link to License: | Attribution-NonCommercial-NoDerivs 2.0 Generic |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
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. Available under: doi: 10.1007/s004530010029
@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:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5897"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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: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> <dcterms:bibliographicCitation>First publ. in: Algorithmica ; 28 (2000), 1. - S. 16-36</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dc:creator>Wagner, Dorothea</dc:creator> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dc:format>application/pdf</dc:format> <dc:language>eng</dc:language> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5897/1/fulltext.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5897"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:13Z</dc:date> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5897/1/fulltext.pdf"/> <dc:contributor>Wagner, Dorothea</dc:contributor> </rdf:Description> </rdf:RDF>
Downloads since Oct 1, 2014 (Information about access statistics)
| fulltext.pdf | 251 |
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic
Search KOPS
Browse
My Account
