Publikation: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
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.
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BRANDES, Ulrik, Dorothea WAGNER, 1997. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed GraphsBibTex
@unpublished{Brandes1997Linea-6203, year={1997}, title={A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs}, author={Brandes, Ulrik and Wagner, Dorothea} }
RDF
<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/server/rdf/resource/123456789/6203"> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:09Z</dcterms:available> <dcterms:title>A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs</dcterms:title> <dc:rights>terms-of-use</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6203/1/preprint_029.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6203/1/preprint_029.pdf"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:09Z</dc:date> <dc:format>application/pdf</dc:format> <dcterms:issued>1997</dcterms:issued> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:contributor>Wagner, Dorothea</dc:contributor> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6203"/> <dc:creator>Brandes, Ulrik</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Wagner, Dorothea</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>