Accelerated bend minimization

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

CORNELSEN, 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, pp. 111-122. ISBN 978-3-642-25878-7

@inproceedings{Cornelsen2012Accel-19254, title={Accelerated bend minimization}, year={2012}, number={7034}, isbn={978-3-642-25878-7}, address={Berlin}, publisher={Springer}, 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 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/19254"> <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:language>eng</dc:language> <dc:creator>Cornelsen, Sabine</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-05-09T09:53:12Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dc:creator>Karrenbauer, Andreas</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/19254"/> <dcterms:title>Accelerated bend minimization</dcterms:title> <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> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <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> <dc:contributor>Cornelsen, Sabine</dc:contributor> <dcterms:issued>2012</dcterms:issued> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto