LIPIcs.IPEC.2022.27.pdf
- Filesize: 0.5 MB
- 3 pages
Document
PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem
Author
Sylwester Swat 
-
Part of:
Volume:
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 4.0 International license
- Publication date: 2022-12-14
File
Document Identifiers
Author Details
Cite AsGet 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
https://doi.org/10.4230/LIPIcs.IPEC.2022.27
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).
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)
0PDF Downloads
References
- 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.
- 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.
- 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.
- 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.
- 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.