Publikation:

Accelerated bend minimization

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2012

Autor:innen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-192548
DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Zukunftskolleg: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

MARC, van Kreveld, ed. and others. Graph drawing : 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21 - 23, 2011 ; revised selected papers. Berlin: Springer, 2012, pp. 111-122. Lecture notes in computer science. 7034. ISBN 978-3-642-25878-7

Zusammenfassung

We present an O(n3/2) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4 √ log n) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n3/2) time.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690CORNELSEN, Sabine, Andreas KARRENBAUER, 2012. Accelerated bend minimization. In: MARC, van Kreveld, ed. and others. Graph drawing : 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21 - 23, 2011 ; revised selected papers. Berlin: Springer, 2012, pp. 111-122. Lecture notes in computer science. 7034. ISBN 978-3-642-25878-7
BibTex
@inproceedings{Cornelsen2012Accel-19254,
  year={2012},
  title={Accelerated bend minimization},
  number={7034},
  isbn={978-3-642-25878-7},
  publisher={Springer},
  address={Berlin},
  series={Lecture notes in computer science},
  booktitle={Graph drawing  :  19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21 - 23, 2011  ;  revised selected papers},
  pages={111--122},
  editor={Marc, van Kreveld},
  author={Cornelsen, Sabine and Karrenbauer, Andreas}
}
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/19254">
    <dc:creator>Karrenbauer, Andreas</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-05-09T09:53:12Z</dcterms:available>
    <dcterms:title>Accelerated bend minimization</dcterms:title>
    <dcterms:issued>2012</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/19254"/>
    <dcterms:abstract xml:lang="eng">We present an O(n3/2) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4 √ log n) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n3/2) time.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:contributor>Karrenbauer, Andreas</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-05-09T09:53:12Z</dc:date>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:bibliographicCitation>Publ. in: Graph drawing : 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21 - 23, 2011 ; revised selected papers / Marc van Kreveld... (eds.). - Berlin : Springer, 2012. - pp. 111-122. - (Lecture notes in computer science ; 7034). - ISBN 978-3-642-25878-7</dcterms:bibliographicCitation>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen