Extending simple drawings with one edge is hard

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera

Publikation: Beitrag in einer FachzeitschriftArtikelForschung

Abstract

A simple drawing $D(G)$ of a graph $G = (V,E)$ is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing. An edge $e$ from the complement of $ G $ can be inserted into $D(G)$ if there exists a simple drawing of $G' = (V, E\cup \{e\})$ containing $D(G)$ as a subdrawing. We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing, by this solving an open question by Arroyo, Derka, and Parada.
Originalspracheundefiniert/unbekannt
Seitenumfang10
FachzeitschriftarXiv.org e-Print archive
PublikationsstatusVeröffentlicht - 16 Sep 2019

Schlagwörter

    Dies zitieren

    Arroyo, A., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., & Wiedera, T. (2019). Extending simple drawings with one edge is hard. arXiv.org e-Print archive.

    Extending simple drawings with one edge is hard. / Arroyo, Alan; Klute, Fabian; Parada, Irene; Seidel, Raimund; Vogtenhuber, Birgit; Wiedera, Tilo.

    in: arXiv.org e-Print archive, 16.09.2019.

    Publikation: Beitrag in einer FachzeitschriftArtikelForschung

    Arroyo, A, Klute, F, Parada, I, Seidel, R, Vogtenhuber, B & Wiedera, T 2019, 'Extending simple drawings with one edge is hard' arXiv.org e-Print archive.
    Arroyo A, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Extending simple drawings with one edge is hard. arXiv.org e-Print archive. 2019 Sep 16.
    Arroyo, Alan ; Klute, Fabian ; Parada, Irene ; Seidel, Raimund ; Vogtenhuber, Birgit ; Wiedera, Tilo. / Extending simple drawings with one edge is hard. in: arXiv.org e-Print archive. 2019.
    @article{ee42aede67fe4780a2c747ef7e5ac1b5,
    title = "Extending simple drawings with one edge is hard",
    abstract = "A simple drawing $D(G)$ of a graph $G = (V,E)$ is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing. An edge $e$ from the complement of $ G $ can be inserted into $D(G)$ if there exists a simple drawing of $G' = (V, E\cup \{e\})$ containing $D(G)$ as a subdrawing. We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing, by this solving an open question by Arroyo, Derka, and Parada.",
    keywords = "cs.CG",
    author = "Alan Arroyo and Fabian Klute and Irene Parada and Raimund Seidel and Birgit Vogtenhuber and Tilo Wiedera",
    note = "10 pages",
    year = "2019",
    month = "9",
    day = "16",
    language = "undefiniert/unbekannt",
    journal = "arXiv.org e-Print archive",
    publisher = "Cornell University Library",

    }

    TY - JOUR

    T1 - Extending simple drawings with one edge is hard

    AU - Arroyo, Alan

    AU - Klute, Fabian

    AU - Parada, Irene

    AU - Seidel, Raimund

    AU - Vogtenhuber, Birgit

    AU - Wiedera, Tilo

    N1 - 10 pages

    PY - 2019/9/16

    Y1 - 2019/9/16

    N2 - A simple drawing $D(G)$ of a graph $G = (V,E)$ is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing. An edge $e$ from the complement of $ G $ can be inserted into $D(G)$ if there exists a simple drawing of $G' = (V, E\cup \{e\})$ containing $D(G)$ as a subdrawing. We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing, by this solving an open question by Arroyo, Derka, and Parada.

    AB - A simple drawing $D(G)$ of a graph $G = (V,E)$ is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing. An edge $e$ from the complement of $ G $ can be inserted into $D(G)$ if there exists a simple drawing of $G' = (V, E\cup \{e\})$ containing $D(G)$ as a subdrawing. We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing, by this solving an open question by Arroyo, Derka, and Parada.

    KW - cs.CG

    M3 - Artikel

    JO - arXiv.org e-Print archive

    JF - arXiv.org e-Print archive

    ER -