We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Editing to Eulerian graphs.

Dabrowski, K.K. and Golovach, P.A. and Hof, van 't P. and Paulusma, D. (2014) 'Editing to Eulerian graphs.', in 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Saarbrücken, Germany: Schloss Dagstuhl, pp. 97-108. Leibniz International Proceedings in Informatics (LIPIcs). (29).


We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively. For any S subseteq {ea,ed,vd}, we define Connected Degree Parity Editing (S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and a function delta: V(G) -> {0,1}, and asks whether G can be modified into a connected graph H with d_H(v) = delta(v)(mod 2) for each v in V(H), using at most k operations from S. We prove that (*) if S={ea} or S={ea,ed}, then CDPE(S) can be solved in polynomial time; (*) if {vd} subseteq S subseteq {ea,ed,vd}, then CDPE(S) is NP-complete and W-hard when parameterized by k, even if delta = 0. Together with known results by Cai and Yang and by Cygan, Marx, Pilipczuk, Pilipczuk and Schlotter, our results completely classify the classical and parameterized complexity of the CDPE(S) problem for all S subseteq {ea,ed,vd}. We obtain the same classification for a natural variant of the cdpe(S) problem on directed graphs, where the target is a weakly connected digraph in which the difference between the in- and out-degree of every vertex equals a prescribed value. As an important implication of our results, we obtain polynomial-time algorithms for Eulerian Editing problem and its directed variant. To the best of our knowledge, the only other natural non-trivial graph class H for which the H-Editing problem is known to be polynomial-time solvable is the class of split graphs.

Item Type:Book chapter
Keywords:Eulerian graphs, graph editing, polynomial algorithm
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:Available under License Creative Commons Attribution No Derivatives.
Date accepted:No date available
Date deposited:08 January 2015
Date of first online publication:2014
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar