PACE Solver Description: Mount Doom – An Exact Solver for Directed Feedback Vertex Set

Sebastian Angrick*, Katrin Casel*, Tobias Friedrich*, Theresa Hradilak*, Otto Kißig*, Leo Wendt*, Ben Bals*, Sarel Cohen*, Niko Hastrich*, Davis Issac*, Jonas Schmidt*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this document we describe the techniques we used and implemented for our submission to the Parameterized Algorithms and Computational Experiments Challenge (PACE) 2022. The given problem is Directed Feedback Vertex Set (DFVS), where one is given a directed graph G = (V, E) and wants to find a minimum S ⊆ V such that G - S is acyclic. We approach this problem by first exhaustively applying a set of reduction rules. In order to find a minimum DFVS on the remaining instance, we create and solve a series of Vertex Cover instances.

Original languageEnglish
Title of host publication17th International Symposium on Parameterized and Exact Computation, IPEC 2022
EditorsHolger Dell, Jesper Nederlof
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772600
DOIs
StatePublished - 1 Dec 2022
Externally publishedYes
Event17th International Symposium on Parameterized and Exact Computation, IPEC 2022 - Potsdam, Germany
Duration: 7 Sep 20229 Sep 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume249
ISSN (Print)1868-8969

Conference

Conference17th International Symposium on Parameterized and Exact Computation, IPEC 2022
Country/TerritoryGermany
CityPotsdam
Period7/09/229/09/22

Keywords

  • directed feedback vertex set
  • reduction rules
  • vertex cover

Fingerprint

Dive into the research topics of 'PACE Solver Description: Mount Doom – An Exact Solver for Directed Feedback Vertex Set'. Together they form a unique fingerprint.

Cite this