Crossing Reduction in Circular Layouts

Baur, Michael; Brandes, Ulrik

Crossing Reduction in Circular Layouts

Files

bb_crcl_04.pdf(327.68 KB)

Date

2005

Authors

Baur, Michael

Brandes, Ulrik

Publication type

Contribution to a conference collection

Published in

Graph-Theoretic Concepts in Computer Science / Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. - (Lecture Notes in Computer Science ; 3353). - pp. 332-343. - ISBN 978-3-540-24132-4

Abstract

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.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

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

BibTex

@inproceedings{Baur2005Cross-5764,
  year={2005},
  doi={10.1007/978-3-540-30559-0_28},
  title={Crossing Reduction in Circular Layouts},
  number={3353},
  isbn={978-3-540-24132-4},
  publisher={Springer Berlin Heidelberg},
  address={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: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/5764">
    <dc:contributor>Baur, Michael</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dcterms:available>
    <dcterms:issued>2005</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Crossing Reduction in Circular Layouts</dcterms:title>
    <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>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5764"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5764/1/bb_crcl_04.pdf"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:creator>Baur, Michael</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:54Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5764/1/bb_crcl_04.pdf"/>
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: Lecture notes in computer science, No. 3353 (2004), pp. 332-343</dcterms:bibliographicCitation>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes