Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Crossing Reduction in Circular Layouts

Cite This

Files in this item

Checksum: 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. Available under: doi: 10.1007/978-3-540-30559-0_28

@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:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:available rdf:datatype="">2011-03-24T15:59:54Z</dcterms:available> <dcterms:hasPart rdf:resource=""/> <dc:creator>Brandes, Ulrik</dc:creator> <dspace:hasBitstream rdf:resource=""/> <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:rights rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: Lecture notes in computer science, No. 3353 (2004), pp. 332-343</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource=""/> <bibo:uri rdf:resource=""/> <dcterms:issued>2005</dcterms:issued> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Baur, Michael</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Brandes, Ulrik</dc:contributor> <dc:creator>Baur, Michael</dc:creator> <dcterms:title>Crossing Reduction in Circular Layouts</dcterms:title> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:format>application/pdf</dc:format> <dc:date rdf:datatype="">2011-03-24T15:59:54Z</dc:date> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

bb_crcl_04.pdf 405

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 2.0 Generic Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic

Search KOPS


My Account