Document Open Access Logo

PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem

Author Sylwester Swat

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2022.27.pdf
  • Filesize: 0.5 MB
  • 3 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
Keywords
  • Directed feedback vertex set
  • heuristic solver
  • graph algorithms
  • PACE 2022

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This article briefly describes the most important algorithms and techniques used in the directed feedback vertex set heuristic solver called "DiVerSeS", submitted to the 7th Parameterized Algorithms and Computational Experiments Challenge (PACE 2022).

Cite As Get BibTex

Sylwester Swat. PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 27:1-27:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.IPEC.2022.27

Author Details

Sylwester Swat
  • Institute of Computing Science, Poznań University of Technology, Poland

Funding

Supported by the Foundation for Polish Science (FNP).

Supplementary Materials

References

  1. Shaowei Cai, Jinkun Lin, and Chuan Luo. Finding a small vertex cover in massive sparse graphs: Construct, local search, and preprocess. Journal of Artificial Intelligence Research, 59:463-494, July 2017. URL: https://doi.org/10.1613/jair.5443.
  2. Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. Numvc: An efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research, 46, February 2014. URL: https://doi.org/10.1613/jair.3907.
  3. Philippe Galinier, Eunice Lemamou, and Mohamed Bouzidi. Applying local search to the feedback vertex set problem. Journal of Heuristics, 19, October 2013. URL: https://doi.org/10.1007/s10732-013-9224-z.
  4. Hanoch Levy and David W Low. A contraction algorithm for finding small cycle cutsets. Journal of Algorithms, 9(4):470-493, 1988. URL: https://doi.org/10.1016/0196-6774(88)90013-2.
  5. Hen-Ming Lin and Jing-Yang Jou. On computing the minimum feedback vertex set of a directed graph by contraction operations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(3):295-307, 2000. URL: https://doi.org/10.1109/43.833199.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact