Searching for smallest universal graphs and tournaments with SAT

Abstract

Full Citation:

Tianwei Zhang, Stefan Szeider. Searching for smallest universal graphs and tournaments with SAT. Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap), volume 280 of LIPIcs, pages 39:1-39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Tianwei Zhang

Tianwei Zhang is a Project Assistant at the Algorithms and Complexity Group.

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.