Publikation:

Algorithms and Characterizations for 2-Layer Fan-planarity : From Caterpillar to Stegosaurus

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2017

Autor:innen

Binucci, Carla
Chimani, Markus
Didimo, Walter
Gronemann, Martin
Kratochvíl, Jan
Montecchiani, Fabrizio
Tollis, Ioannis G.

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.7155/jgaa.00398
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Journal of Graph Algorithms and Applications. 2017, 21(1), pp. 81-102. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00398

Zusammenfassung

In a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fan-planar drawings such that the vertices are restricted to two distinct horizontal layers and edges are straight-line segments that connect vertices of dierent layers. We characterize 2-layer fan-planar drawable graphs and describe a linear-time testing and embedding algorithm for biconnected graphs. We also study the relationship between 2-layer fan-planar graphs and 2-layer right-angle crossing graphs.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BINUCCI, Carla, Markus CHIMANI, Walter DIDIMO, Martin GRONEMANN, Karsten KLEIN, Jan KRATOCHVÍL, Fabrizio MONTECCHIANI, Ioannis G. TOLLIS, 2017. Algorithms and Characterizations for 2-Layer Fan-planarity : From Caterpillar to Stegosaurus. In: Journal of Graph Algorithms and Applications. 2017, 21(1), pp. 81-102. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00398
BibTex
@article{Binucci2017Algor-44635,
  year={2017},
  doi={10.7155/jgaa.00398},
  title={Algorithms and Characterizations for 2-Layer Fan-planarity : From Caterpillar to Stegosaurus},
  number={1},
  volume={21},
  journal={Journal of Graph Algorithms and Applications},
  pages={81--102},
  author={Binucci, Carla and Chimani, Markus and Didimo, Walter and Gronemann, Martin and Klein, Karsten and Kratochvíl, Jan and Montecchiani, Fabrizio and Tollis, Ioannis G.}
}
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/44635">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Montecchiani, Fabrizio</dc:contributor>
    <dcterms:title>Algorithms and Characterizations for 2-Layer Fan-planarity : From Caterpillar to Stegosaurus</dcterms:title>
    <dc:language>eng</dc:language>
    <dc:contributor>Kratochvíl, Jan</dc:contributor>
    <dc:contributor>Binucci, Carla</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Didimo, Walter</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44635"/>
    <dcterms:abstract xml:lang="eng">In a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fan-planar drawings such that the vertices are restricted to two distinct horizontal layers and edges are straight-line segments that connect vertices of dierent layers. We characterize 2-layer fan-planar drawable graphs and describe a linear-time testing and embedding algorithm for biconnected graphs. We also study the relationship between 2-layer fan-planar graphs and 2-layer right-angle crossing graphs.</dcterms:abstract>
    <dc:creator>Didimo, Walter</dc:creator>
    <dc:contributor>Chimani, Markus</dc:contributor>
    <dc:creator>Montecchiani, Fabrizio</dc:creator>
    <dc:contributor>Klein, Karsten</dc:contributor>
    <dcterms:issued>2017</dcterms:issued>
    <dc:contributor>Gronemann, Martin</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-21T11:13:17Z</dcterms:available>
    <dc:creator>Klein, Karsten</dc:creator>
    <dc:contributor>Tollis, Ioannis G.</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Gronemann, Martin</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-21T11:13:17Z</dc:date>
    <dc:creator>Kratochvíl, Jan</dc:creator>
    <dc:creator>Chimani, Markus</dc:creator>
    <dc:creator>Binucci, Carla</dc:creator>
    <dc:creator>Tollis, Ioannis G.</dc:creator>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Ja
Diese Publikation teilen