Publikation: Planar L-Drawings of Bimodal Graphs
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2021
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
AUBER, David, ed., Pavel VALTR, ed.. Graph Drawing and Network Visualization, 28th International Symposium, GD 2020 : Revised Selected Papers. Cham: Springer, 2021, pp. 205-219. Lecture Notes in Computer Science. 12590. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-68765-6. Available under: doi: 10.1007/978-3-030-68766-3_17
Zusammenfassung
In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not cross. Our main focus is on bimodal graphs, i.e., digraphs admitting a planar embedding in which the incoming and outgoing edges around each vertex are contiguous. We show that every plane bimodal graph without 2-cycles admits a planar L-drawing. This includes the class of upward-plane graphs. Finally, outerplanar digraphs admit a planar L-drawing – although they do not always have a bimodal embedding – but not necessarily with an outerplanar embedding.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Planar L-drawings, Directed graphs, Bimodality
Konferenz
Graph Drawing and Network Visualization, 28th International Symposium, GD 2020, 16. Sept. 2020 - 18. Sept. 2020, Vancouver, BC, Canada
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
ANGELINI, Patrizio, Steven CHAPLICK, Sabine CORNELSEN, Giordano DA LOZZO, 2021. Planar L-Drawings of Bimodal Graphs. Graph Drawing and Network Visualization, 28th International Symposium, GD 2020. Vancouver, BC, Canada, 16. Sept. 2020 - 18. Sept. 2020. In: AUBER, David, ed., Pavel VALTR, ed.. Graph Drawing and Network Visualization, 28th International Symposium, GD 2020 : Revised Selected Papers. Cham: Springer, 2021, pp. 205-219. Lecture Notes in Computer Science. 12590. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-68765-6. Available under: doi: 10.1007/978-3-030-68766-3_17BibTex
@inproceedings{Angelini2021Plana-57811, year={2021}, doi={10.1007/978-3-030-68766-3_17}, title={Planar L-Drawings of Bimodal Graphs}, number={12590}, isbn={978-3-030-68765-6}, issn={0302-9743}, publisher={Springer}, address={Cham}, series={Lecture Notes in Computer Science}, booktitle={Graph Drawing and Network Visualization, 28th International Symposium, GD 2020 : Revised Selected Papers}, pages={205--219}, editor={Auber, David and Valtr, Pavel}, author={Angelini, Patrizio and Chaplick, Steven and Cornelsen, Sabine and Da Lozzo, Giordano} }
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/57811"> <dc:contributor>Chaplick, Steven</dc:contributor> <dcterms:title>Planar L-Drawings of Bimodal Graphs</dcterms:title> <dcterms:abstract xml:lang="eng">In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not cross. Our main focus is on bimodal graphs, i.e., digraphs admitting a planar embedding in which the incoming and outgoing edges around each vertex are contiguous. We show that every plane bimodal graph without 2-cycles admits a planar L-drawing. This includes the class of upward-plane graphs. Finally, outerplanar digraphs admit a planar L-drawing – although they do not always have a bimodal embedding – but not necessarily with an outerplanar embedding.</dcterms:abstract> <dc:contributor>Cornelsen, Sabine</dc:contributor> <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">2022-06-21T11:40:19Z</dc:date> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Chaplick, Steven</dc:creator> <dc:contributor>Da Lozzo, Giordano</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Cornelsen, Sabine</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-06-21T11:40:19Z</dcterms:available> <dc:creator>Da Lozzo, Giordano</dc:creator> <dc:creator>Angelini, Patrizio</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/57811"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:contributor>Angelini, Patrizio</dc:contributor> <dcterms:issued>2021</dcterms:issued> </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