Technical Appendix for Bimodal Depth-First Search for Scalable GAC for AllDifferent
Résumé
This document is the technical appendix for the paper entitled "Bimodal Depth-First Search for Scalable GAC for AllDifferent" accepted at IJCAI 2025. Section 1 presents the complete proof of Theorem 2. Section 2 details the bimodal algorithm for finding a maximum matching in the variable-value graph. Section 3 details the bimodal algorithm for computing the strongly connected components in the residual graph and finding the variable-value pairs to prune.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |