no code implementations • 14 Jul 2022 • Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
We illustrate the advantages of this framework by instantiating our general algorithmic approach on several classes of problems (e. g., the $H$-coloring problem and its variants), and showing that it improves the best complexity upper bounds in the literature for several well-known problems.
