Publikation:

Planarity of the 2-Level Cactus Model

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2001

Autor:innen

Dinitz, Yefim
Wagner, Dorothea

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.1007/3-540-45477-2_10
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
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

BRANDSTÄDT, Andreas, ed. and others. Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001, Proceedings. Berlin: Springer, 2001, pp. 91-102. Lecture Notes in Computer Science. 2204. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-42707-0. Available under: doi: 10.1007/3-540-45477-2_10

Zusammenfassung

The 2-level cactus introduced by Dinitz and Nutov in [5] is a data structure that represents the minimum and minimum+1 edgecuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001, 14. Juni 2001 - 16. Juni 2001, Boltenhagen, Germany
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690CORNELSEN, Sabine, Yefim DINITZ, Dorothea WAGNER, 2001. Planarity of the 2-Level Cactus Model. Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001. Boltenhagen, Germany, 14. Juni 2001 - 16. Juni 2001. In: BRANDSTÄDT, Andreas, ed. and others. Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001, Proceedings. Berlin: Springer, 2001, pp. 91-102. Lecture Notes in Computer Science. 2204. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-42707-0. Available under: doi: 10.1007/3-540-45477-2_10
BibTex
@inproceedings{Cornelsen2001-10-02Plana-44804,
  year={2001},
  doi={10.1007/3-540-45477-2_10},
  title={Planarity of the 2-Level Cactus Model},
  number={2204},
  isbn={978-3-540-42707-0},
  issn={0302-9743},
  publisher={Springer},
  address={Berlin},
  series={Lecture Notes in Computer Science},
  booktitle={Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001, Proceedings},
  pages={91--102},
  editor={Brandstädt, Andreas},
  author={Cornelsen, Sabine and Dinitz, Yefim and Wagner, Dorothea}
}
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/44804">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:contributor>Dinitz, Yefim</dc:contributor>
    <dcterms:title>Planarity of the 2-Level Cactus Model</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:18:15Z</dc:date>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44804"/>
    <dcterms:issued>2001-10-02</dcterms:issued>
    <dc:creator>Dinitz, Yefim</dc:creator>
    <dc:creator>Wagner, Dorothea</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-01T13:18:15Z</dcterms:available>
    <dc:contributor>Wagner, Dorothea</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dcterms:abstract xml:lang="eng">The 2-level cactus introduced by Dinitz and Nutov in [5] is a data structure that represents the minimum and minimum+1 edgecuts of an undirected connected multi-graph G in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of G is planar if the cardinality of a minimum edge-cut of G is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.</dcterms:abstract>
  </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
Nein
Begutachtet
Diese Publikation teilen