PACE Solver Description: RedAlert - Heuristic Track

Authors Édouard Bonnet , Julien Duron



PDF
Thumbnail PDF

File

LIPIcs.IPEC.2023.40.pdf
  • Filesize: 0.57 MB
  • 5 pages

Document Identifiers

Author Details

Édouard Bonnet
  • Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France
Julien Duron
  • Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France

Cite AsGet BibTex

Édouard Bonnet and Julien Duron. PACE Solver Description: RedAlert - Heuristic Track. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 40:1-40:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.IPEC.2023.40

Abstract

We present RedAlert, a heuristic solver for twin-width, submitted to the Heuristic Track of the 2023 edition of the Parameterized Algorithms and Computational Experiments (PACE) challenge.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • twin-width
  • contraction sequences
  • heuristic
  • pair sampling
  • pair filtering

Metrics

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

References

  1. Jungho Ahn, Kevin Hendrey, Donggyu Kim, and Sang-il Oum. Bounds for the twin-width of graphs. SIAM J. Discret. Math., 36(3):2352-2366, 2022. URL: https://doi.org/10.1137/21m1452834.
  2. Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width I: tractable FO model checking. J. ACM, 69(1):3:1-3:46, 2022. URL: https://doi.org/10.1145/3486655.
  3. Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci., 348(2-3):357-365, 2005. URL: https://doi.org/10.1016/j.tcs.2005.09.023.