Crossing Reduction in Circular Layouts

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:7bd6b3a12d00a306b727054cfd93d073

BAUR, Michael, Ulrik BRANDES, 2005. Crossing Reduction in Circular Layouts. In: HROMKOVIČ, Juraj, ed., Manfred NAGL, ed., Bernhard WESTFECHTEL, ed.. Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 332-343. ISBN 978-3-540-24132-4

@inproceedings{Baur2005Cross-5764, title={Crossing Reduction in Circular Layouts}, year={2005}, doi={10.1007/978-3-540-30559-0_28}, number={3353}, isbn={978-3-540-24132-4}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Graph-Theoretic Concepts in Computer Science}, pages={332--343}, editor={Hromkovič, Juraj and Nagl, Manfred and Westfechtel, Bernhard}, author={Baur, Michael and Brandes, Ulrik} }

<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/5764"> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dcterms:available> <dc:creator>Brandes, Ulrik</dc:creator> <dcterms:abstract xml:lang="eng">We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the sifting heuristic for crossing reduction in layered layouts is used for local optimization in the second phase. Both phases are conceptually simpler than previous heuristics, and our extensive experimental results indicate that they also yield fewer crossings. An interesting feature is their straightforward generalization to the weighted case.</dcterms:abstract> <dcterms:bibliographicCitation>First publ. in: Lecture notes in computer science, No. 3353 (2004), pp. 332-343</dcterms:bibliographicCitation> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5764"/> <dcterms:issued>2005</dcterms:issued> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Baur, Michael</dc:contributor> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Baur, Michael</dc:creator> <dcterms:title>Crossing Reduction in Circular Layouts</dcterms:title> <dc:format>application/pdf</dc:format> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dc:date> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

bb_crcl_04.pdf 99

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto