More canonical ordering
Lade...
Dateien
Datum
2011
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Journal of Graph Algorithms and Applications. 2011, 15(1), pp. 97-126. Available under: doi: 10.7155/jgaa.00219
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BAUR, 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.00219BibTex
@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} }
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>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja