Document Open Access Logo

PACE Solver Description: Hydra Prime

Authors Yosuke Mizutani , David Dursteler , Blair D. Sullivan

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2023.36.pdf
  • Filesize: 0.75 MB
  • 5 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • Twin-width
  • PACE 2023

Metrics

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

Abstract

This note describes our submission to the 2023 PACE Challenge on the computation of twin-width. Our solver Hydra Prime combines modular decomposition with a collection of upper- and lower-bound algorithms, which are alternatingly applied on the prime graphs resulting from the modular decomposition. We introduce two novel approaches which contributed to the solver’s winning performance in the Exact Track: timeline encoding and hydra decomposition. Timeline encoding is a new data structure for computing the width of a given contraction sequence, enabling faster local search; the hydra decomposition is an iterative refinement strategy featuring a small vertex separator.

Cite As Get BibTex

Yosuke Mizutani, David Dursteler, and Blair D. Sullivan. PACE Solver Description: Hydra Prime. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 36:1-36:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.IPEC.2023.36

Author Details

Yosuke Mizutani
  • University of Utah, Salt Lake City, UT, USA
David Dursteler
  • University of Utah, Salt Lake City, UT, USA
Blair D. Sullivan
  • University of Utah, Salt Lake City, UT, USA

Funding

  • Sullivan, Blair D.: This work was supported in part by the Gordon & Betty Moore Foundation under award GBMF4560.

Supplementary Materials

References

  1. Armin Biere and Mathias Fleury. Gimsatul, IsaSAT and Kissat entering the SAT Competition 2022. In Proc. of SAT Competition 2022 – Solver and Benchmark Descriptions, volume B-2022-1 of Department of Computer Science Series of Publications B, pages 10-11, 2022. Google Scholar
  2. Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width I: tractable FO model checking. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 601-612, 2020. Google Scholar
  3. Reinhard Diestel. Graph Theory. Springer Publishing Company, Inc., 5th edition, 2017. Google Scholar
  4. Michel Habib and Christophe Paul. A survey of the algorithmic aspects of modular decomposition. Computer Science Review, 4(1):41-59, 2010. Google Scholar
  5. André Schidler and Stefan Szeider. A SAT Approach to Twin-Width. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pages 67-77, 2022. Google Scholar
  6. Marc Tedder, Derek Corneil, Michel Habib, and Christophe Paul. Simple, linear-time modular decomposition, 2008. arXiv:0710.3901. Google Scholar
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