Parameterized complexity of eulerian deletion problems

  • Authors:

  • Marek Cygan;D$#225/niel Marx;Marcin Pilipczuk;Micha$#322/ Pilipczuk;Ildikó/ Schlotter

  • Affiliations:

  • Institute of Informatics, University of Warsaw, Poland;Institut fü/r Informatik, Humboldt-Universitä/t zu Berlin, Germany;Institute of Informatics, University of Warsaw, Poland;Institute of Informatics, University of Warsaw, Poland;Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary

  • Venue:
  • WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study a family of problems where the goal is to make a graph Eulerian by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc. Of particular interest is a randomized FPT algorithm for making an undirected graph Eulerian by deleting the minimum number of edges.