Undirected forest constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 29-43

  Beldiceanu, Nicolas ^a   Katriel, Irit ^b   Lorca, Xavier ^a  

^a CNRS   (France)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; INTEGRATION; OPTIMIZATION; RESOURCE ALLOCATION;

FOREST CONSTRAINT; HYBRID-CONSISTENCY ALGORITHM; RESOURCE VERTEX; VERTEX-DISJOINT;

GRAPH THEORY;

EID: 33746067871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_5     Document Type: Conference Paper

References (14)

1. N. Beldiceanu, P. Flener, and X. Lorca. The tree Constraint. In CP-AI-OR'05, volume 3524 of LNCS, pages 64-78. Springer-Verlag, May 2005.
2. J.-L. Laurière. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10:29-127, 1978.
3. N. Beldiceanu and E. Contejean. Introducing global constraint in CHIP. Mathl. Comput. Modelling, 20(12):97-123, 1994.
4. M. Sellmann. Cost-based filtering for shortest path constraints. In CP 2003, volume 2833 of LNCS, pages 694-708. Springer-Verlag, 2003.
5. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Int. Conf. on Fifth Generation Computer Systems (FGCS'88), pages 693-702, Tokyo, Japan, 1988.
6. J.-F. Puget. A C++ Implementation of CLP. In Second Singapore International Conference on Intelligent Systems (SPICIS), pages 256-261, Singapore, November 1994.
7. A. Cayley. A theorem on trees. Quart. J. Math., 23:376-378, 1889.
8. C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh. The range and roots Constraints: Specifying Counting and Occurrence Problems. In IJCAI-05, pages 60-65, 2005.
9. C. Berge. Graphes. Dunod, New York, 2nd edition, 1985. In French.
10. M. Sellmann. Reduction techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn, 2002.
11. J.-C. Régin. A filtering algorithm for constraints of difference in CSP. In AAAI-94, pages 362-367, 1994.
12. M. Gondran and M. Minoux. Graphes et algorithmes. Eyrolles, Paris, 2nd edition, 1985. In French.
13. S. Micali and V. V. Vazirani. An O (√|V| · |E|) algorithm for finding maximum matching in general graphs. In FOCS 1980, pages 17-27, New York, 1980. IEEE.
14. N. Beldiccanu, T. Petit, and G. Rochart. Bounds of Graph Characteristics, In P. van Beek, editor, CP 2005, volume 3709 of LNCS, pages 742-746. Springer-Verlag, 2005.