DeepAI AI Chat
Log In Sign Up

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

by   Andrei Arhire, et al.
Alexandru Ioan Cuza University

A feedback vertex set of a graph is a set of nodes with the property that every cycle contains at least one vertex from the set i.e. the removal of all vertices from a feedback vertex set leads to an acyclic graph. In this short paper, we describe the algorithm for finding a minimum directed feedback vertex set used by the _UAIC_ANDREIARHIRE_ solver, submitted to the heuristic track of the 2022 PACE challenge.


page 1

page 2

page 3

page 4


A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

A tournament is a directed graph T such that every pair of vertices is ...

Tight Localizations of Feedback Sets

The classical NP-hard feedback arc set problem (FASP) and feedback verte...

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

We propose a new approach to the Directed Feedback Vertex Set Problem (D...

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...

Computing a Feedback Arc Set Using PageRank

We present a new heuristic algorithm for computing a minimum Feedback Ar...

Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT

In directed graphs, we investigate the problems of finding: 1) a minimum...

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set

Recent empirical evaluations of exact algorithms for Feedback Vertex Set...