On the Practicality of DQBF Solving for Succinctly Represented Graph Problems
收藏官方服务：
资源简介：
An experiment framework for extracting succinct and explicit graphs from Boolean sequential circuits, encoding graph problems (Clique, Coloring, Hamiltonian) into Dependency Quantified Boolean Formulas (DQBF), and evaluating them against state-of-the-art solvers. We provide the generator and the benchmarks. The DQBF instances can be found in file dqdimacs_benchmarks.tgz.
提供机构：
Zenodo创建时间：
2026-05-11
