The symmetric alldiff constraint

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 420-425

  Regin, Jean Charles ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCY; FILTERING ALGORITHM; REAL-WORLD PROBLEM; SPORTS SCHEDULING;

ARTIFICIAL INTELLIGENCE;

EID: 0008485426     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. C Berge. Graphe et Hypergraphes. Dunod, Paris. 1970.
2. C. Bcssiere and. J-C Begin. Arc consistency for general constraint networks: preliminary Jesuits. In Proceedings of IJCAI'97, pages 398-404, Nagoya, 1997.
3. J. Edmonds. Path, trees, and flowers. Can. J. Math., 17:449-407, 1965.
4. S. Micali and V.V. Vazirani. An O(√|V||E|) algorithm for finding maximum matching in general graphs. In Proceedings 21st FOGS, pages 17-27, 1980.
5. J-C. Begin. A filtering algorithm for constraints of difference in CSPs. In Proceedings AAA1-94, pages 362-367, Seattle, Washington, 1994.
6. II. Simonis. Problem classification scheme for finite domain constraint solving. In CP96, Workshop on Constraint Programming Applications: An Inventory and Taxonomy, pages 1-26, Cambridge, MA, USA, 1996.
7. B.E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983.