More canonical ordering

Kurzanzeige
dc.contributor.authorBaur, Melanie
dc.contributor.authorBrandes, Ulrik
dc.contributor.authorCornelsen, Sabine
dc.date.accessioned2012-01-24T10:03:45Zdeu
dc.date.available2012-01-24T10:03:45Zdeu
dc.date.issued2011deu
dc.description.abstractCanonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while, it is rather complicated to understand and implement, and the output is not uniquely determined. We present a new approach that is simpler and more intuitive, and that computes a newly de ned leftist canonical ordering of a triconnected graph which is a uniquely determined leftmost canonical ordering. Further, we discuss duality aspects and relations to Schnyder woods.eng
dc.description.versionpublished
dc.identifier.citationFirst publ. in: Journal of Graph Algorithms and Applications ; 15 (2011), 1. - S. 97-126deu
dc.identifier.doi10.7155/jgaa.00219
dc.identifier.ppn357202309deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/17984
dc.language.isoengdeu
dc.legacy.dateIssued2012-01-24deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subject.ddc004deu
dc.titleMore canonical orderingeng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Baur2011canon-17984,
  year={2011},
  doi={10.7155/jgaa.00219},
  title={More canonical ordering},
  number={1},
  volume={15},
  journal={Journal of Graph Algorithms and Applications},
  pages={97--126},
  author={Baur, Melanie and Brandes, Ulrik and Cornelsen, Sabine}
}
kops.citation.iso690BAUR, Melanie, Ulrik BRANDES, Sabine CORNELSEN, 2011. More canonical ordering. In: Journal of Graph Algorithms and Applications. 2011, 15(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219deu
kops.citation.iso690BAUR, Melanie, Ulrik BRANDES, Sabine CORNELSEN, 2011. More canonical ordering. In: Journal of Graph Algorithms and Applications. 2011, 15(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219eng
kops.citation.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/17984">
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: Journal of Graph Algorithms and Applications ; 15 (2011), 1. - S. 97-126</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while, it is rather complicated to understand and implement, and the output is not uniquely determined. We present a new approach that is simpler and more intuitive, and that computes a newly de ned leftist canonical ordering of a triconnected graph which is a uniquely determined leftmost canonical ordering. Further, we discuss duality aspects and relations to Schnyder woods.</dcterms:abstract>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dcterms:title>More canonical ordering</dcterms:title>
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:creator>Baur, Melanie</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17984"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-24T10:03:45Z</dc:date>
    <dc:contributor>Baur, Melanie</dc:contributor>
    <dcterms:issued>2011</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-24T10:03:45Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17984/2/Brandes%20etal.pdf"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17984/2/Brandes%20etal.pdf"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-179849deu
kops.sourcefieldJournal of Graph Algorithms and Applications. 2011, <b>15</b>(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219deu
kops.sourcefield.plainJournal of Graph Algorithms and Applications. 2011, 15(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219deu
kops.sourcefield.plainJournal of Graph Algorithms and Applications. 2011, 15(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219eng
kops.submitter.emailchristine.agorastos@uni-konstanz.dedeu
relation.isAuthorOfPublicationae8f1b49-d468-458b-b8e5-ac771befe3e7
relation.isAuthorOfPublicationfa1660c9-a071-4d01-9bdd-7adcd0e2d7d7
relation.isAuthorOfPublicationab8dd64c-60a5-4662-9603-d40fd0e6c6f3
relation.isAuthorOfPublication.latestForDiscoveryae8f1b49-d468-458b-b8e5-ac771befe3e7
source.bibliographicInfo.fromPage97
source.bibliographicInfo.issue1
source.bibliographicInfo.toPage126
source.bibliographicInfo.volume15
source.periodicalTitleJournal of Graph Algorithms and Applications

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Brandes etal.pdf
Größe:
627.74 KB
Format:
Adobe Portable Document Format
Brandes etal.pdf
Brandes etal.pdfGröße: 627.74 KBDownloads: 830

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0

Sammlungen

Informatik und Informationswissenschaft: Publikationen