Edge-Disjoint Paths in Planar Graphs with Short Total Length

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:c13dd61f676e6298e764ba1421a40c96

BRANDES, Ulrik, Gabriele NEYER, Dorothea WAGNER, 1996. Edge-Disjoint Paths in Planar Graphs with Short Total Length

@unpublished{Brandes1996Edge--5975, title={Edge-Disjoint Paths in Planar Graphs with Short Total Length}, year={1996}, author={Brandes, Ulrik and Neyer, Gabriele 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/5975"> <dcterms:abstract xml:lang="eng">The problem of finding edge-disjoint paths in a planar graph such that each path connects two specified vertices on the outer face of the graph is well studied. The "classical" Eulerian case introduced by Okamura and Seymour is solvable in linear time by an Algorithm introduced by Wagner and Weihe. So far, the length of the paths were not considered. In this paper now, we prove that the problem of finding edge-disjoint paths of minimum total length in a planar graph is NP-hard, even if the graph fullfills the Eulerian condition and the maximum degree is four. Minimizing the length of the longest path is NP-hard as well. Efficient heuristics based on the algorithm by Wagner and Weihe are presented that determine edge-disjoint paths of small total length. We have implemented these heuristics and have studied their behaviour. It turns out that some of the heuristics are empirically very successful.</dcterms:abstract> <dc:language>eng</dc:language> <dc:creator>Neyer, Gabriele</dc:creator> <dcterms:issued>1996</dcterms:issued> <dc:creator>Brandes, Ulrik</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5975"/> <dc:format>application/pdf</dc:format> <dc:contributor>Wagner, Dorothea</dc:contributor> <dc:creator>Wagner, Dorothea</dc:creator> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dcterms:title>Edge-Disjoint Paths in Planar Graphs with Short Total Length</dcterms:title> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:30Z</dc:date> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:08:30Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dc:contributor>Neyer, Gabriele</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

preprint_019.pdf 83

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto