Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Jan 2023 in cs.DM | (2301.11927v1)

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

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Andrei Arhire 
  2. Paul Diac 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up