Rapport (Rapport Technique) Année : 2025

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.

Fichier principal
Vignette du fichier
IJCAI_2025____Bimodal_DFS_AllDifferent__Technical_Appendix_.pdf (293.35 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05062193 , version 1 (09-05-2025)
hal-05062193 , version 2 (21-10-2025)

Licence

Identifiants

  • HAL Id : hal-05062193 , version 1

Citer

Sulian Le Bozec-Chiffoleau, Charles Prud'Homme, Xavier Lorca, Gilles Simonin, Nicolas Beldiceanu. Technical Appendix for Bimodal Depth-First Search for Scalable GAC for AllDifferent. IMT Atlantique. 2025, 5 p. ⟨hal-05062193v1⟩
459 Consultations
252 Téléchargements

Partager

  • More