Editing to Eulerian Graphs

Authors Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniel Paulusma

Thumbnail PDF


  • Filesize: 0.5 MB
  • 12 pages

Document Identifiers

Author Details

Konrad K. Dabrowski
Petr A. Golovach
Pim van 't Hof
Daniel Paulusma

Cite AsGet BibTex

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, and Daniel Paulusma. Editing to Eulerian Graphs. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 97-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


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.
  • Eulerian graphs
  • graph editing
  • polynomial algorithm


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Francis T. Boesch, Charles L. Suffel, and Ralph Tindell. The spanning subgraphs of Eulerian graphs. Journal of Graph Theory, 1(1):79-84, 1977. Google Scholar
  2. Pablo Burzyn, Flavia Bonomo, and Guillermo Durán. NP-completeness results for edge modification problems. Discrete Applied Mathematics, 154(13):1824-1844, 2006. Google Scholar
  3. Leizhen Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58(4):171-176, 1996. Google Scholar
  4. Leizhen Cai and Boting Yang. Parameterized complexity of even/odd subgraph problems. Journal of Discrete Algorithms, 9(3):231-240, 2011. Google Scholar
  5. Katarína Cechlárová and Ildikó Schlotter. Computing the deficiency of housing markets with duplicate houses. In IPEC 2010, volume 6478 of Lecture Notes in Computer Science, pages 72-83. Springer, 2010. Google Scholar
  6. Robert Crowston, Gregory Gutin, Mark Jones, and Anders Yeo. Parameterized Eulerian strong component arc deletion problem on tournaments. Information Processing Letters, 112(6):249-251, 2012. Google Scholar
  7. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Ildikó Schlotter. Parameterized complexity of Eulerian deletion problems. Algorithmica, 68(1):41-61, 2014. Google Scholar
  8. Frederic Dorn, Hannes Moser, Rolf Niedermeier, and Mathias Weller. Efficient algorithms for Eulerian extension and rural postman. SIAM Journal on Discrete Mathematics, 27:75-94, 2013. Google Scholar
  9. Jack Edmonds and Ellis L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5:88-124, 1973. Google Scholar
  10. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google Scholar
  11. Petr A. Golovach. Editing to a connected graph of given degrees. In MFCS Part II, volume 8635 of Lecture Notes in Computer Science, pages 324-335. Springer, 2014. Google Scholar
  12. Petr A. Golovach. Editing to a graph of given degrees. In IPEC 2014, Lecture Notes in Computer Science. Springer, to appear. Google Scholar
  13. Peter L. Hammer and Bruno Simeone. The splittance of a graph. Combinatorica, 1(3):275-284, 1981. Google Scholar
  14. Wiebke Höhn, Tobias Jacobs, and Nicole Megow. On Eulerian extensions and their application to no-wait flowshop scheduling. Journal of Scheduling, 15(3):295-309, 2012. Google Scholar
  15. Linda Lesniak and Ortrud R. Oellermann. An Eulerian exposition. Journal of Graph Theory, 10(3):277-297, 1986. Google Scholar
  16. John M. Lewis and Mihalis Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219-230, 1980. Google Scholar
  17. Luke Mathieson and Stefan Szeider. Editing graphs to satisfy degree constraints: A parameterized approach. Journal of Computer and System Sciences, 78(1):179-191, 2012. Google Scholar
  18. Silvio Micali and Vijay V. Vazirani. An O(√|V| |E|) algorithm for finding maximum matching in general graphs. In FOCS 1980, pages 17-27. IEEE Computer Society, 1980. Google Scholar
  19. Hannes Moser and Dimitrios M. Thilikos. Parameterized complexity of finding regular induced subgraphs. Journal of Discrete Algorithms, 7(2):181-190, 2009. Google Scholar
  20. Assaf Natanzon, Ron Shamir, and Roded Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113(1):109-128, 2001. Google Scholar