Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Fulltext
Submitted manuscript, 339 KB, PDF document
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solves, a proof that this solution is correct. We explain how state of the art maximum clique, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs, and demonstrate that this approach can also handle reductions between problems. The generality of our results suggests that this method is ready for widespread adoption in solvers for combinatorial graph problems.
Original language | English |
---|---|
Title of host publication | Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings |
Editors | Helmut Simonis |
Publisher | Springer |
Publication date | 2020 |
Pages | 338-357 |
ISBN (Print) | 9783030584740 |
DOIs | |
Publication status | Published - 2020 |
Event | 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 - Louvain-la-Neuve, Belgium Duration: 7 Sep 2020 → 11 Sep 2020 |
Conference
Conference | 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 |
---|---|
Land | Belgium |
By | Louvain-la-Neuve |
Periode | 07/09/2020 → 11/09/2020 |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12333 LNCS |
ISSN | 0302-9743 |
ID: 251866968