DeepAI AI Chat
Log In Sign Up

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

by   Rafael Kiesel, et al.
TU Wien

We propose a new approach to the Directed Feedback Vertex Set Problem (DFVSP), where the input is a directed graph and the solution is a minimum set of vertices whose removal makes the graph acyclic. Our approach, implemented in the solver DAGer, is based on two novel contributions: Firstly, we add a wide range of data reductions that are partially inspired by reductions for the similar vertex cover problem. For this, we give a theoretical basis for lifting reductions from vertex cover to DFVSP but also incorporate novel ideas into strictly more general and new DFVSP reductions. Secondly, we propose dynamically encoding DFVSP in propositional logic using cycle propagation for improved performance. Cycle propagation builds on the idea that already a limited number of the constraints in a propositional encoding is usually sufficient for finding an optimal solution. Our algorithm, therefore, starts with a small number of constraints and cycle propagation adds additional constraints when necessary. We propose an efficient integration of cycle propagation into the workflow of MaxSAT solvers, further improving the performance of our algorithm. Our extensive experimental evaluation shows that DAGer significantly outperforms the state-of-the-art solvers and that our data reductions alone directly solve many of the instances.


page 1

page 2

page 3

page 4


PACE Solver Description: A Heuristic Directed Feedback Vertex Set Problem Algorithm

A feedback vertex set of a graph is a set of nodes with the property tha...

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver

Akiba and Iwata [TCS, 2016] demonstrated that a branch and reduce (B R...

Sparse Pose Graph Optimization in Cycle Space

The state-of-the-art modern pose-graph optimization (PGO) systems are ve...

Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination

We introduce novel methods for encoding acyclicity and s-t-reachability ...

Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set

This note describes the development of an exact solver for Minimal Direc...

TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs

The Feedback vertex set with the minimum size is one of Karp's 21 NP-com...