Editing to Eulerian graphs

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

    Research output: Contribution to journalArticleAcademicpeer-review

    3 Citations (Scopus)
    11 Downloads (Pure)

    Abstract

    The Eulerian Editing problem asks, given a graph G and an integer k, whether G can be modified into an Eulerian graph using at most k edge additions and edge deletions. We show that this problem is polynomial-time solvable for both undirected and directed graphs. We generalize these results for problems with degree parity constraints and degree balance constraints, respectively. We also consider the variants where vertex deletions are permitted. Combined with known results, this leads to full complexity classifications for both undirected and directed graphs and for every subset of the three graph operations.
    Original languageEnglish
    Pages (from-to)213-228
    JournalJournal of computer and system sciences
    Volume82
    Issue number2
    DOIs
    Publication statusPublished - 2016

    Fingerprint Dive into the research topics of 'Editing to Eulerian graphs'. Together they form a unique fingerprint.

    Cite this