N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.251

N. Beldiceanu, P. Flener, and X. Lorca, The tree Constraint, CPAIOR'05, pp.64-78, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook, A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, vol.20, issue.6, pp.1265-1296, 1998.
DOI : 10.1145/295656.295663

G. Dooms, Y. Deville, and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, CP'05, pp.211-225, 2005.
DOI : 10.1007/11564751_18

G. F. Italiano, L. Laura, and F. Santaroni, Finding Strong Bridges and Strong Articulation Points in Linear Time, COCOA'10, 2010.

T. Lengauer and R. E. Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems, vol.1, issue.1, 1979.
DOI : 10.1145/357062.357071

J. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, CPAIOR'09, pp.178-192, 2009.
DOI : 10.1007/978-3-642-01929-6_14
URL : https://hal.archives-ouvertes.fr/hal-00394434

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, CP'04, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

L. Quesada, Solving constrained graph problems using reachability constraints based on transitive closure and dominators, 2006.

L. Quesada, P. Van-roy, Y. Deville, and R. Collet, Using Dominators for Solving Constrained Path Problems, PADL'06, pp.73-87, 2006.
DOI : 10.1007/11603023_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.7480

J. Régin, A filtering algorithm for constraints of difference in CSP, AAAI'94, pp.362-367, 1994.

J. Régin, Generalized arc consistency for global cardinality constraint, AAAI'96, pp.209-215, 1996.

J. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, CPAIOR'08, pp.233-247, 2008.
DOI : 10.1007/978-3-540-68155-7_19

P. W. Lauridsen, S. Alstrup, D. Harel, and M. Thorup, Dominators in linear time, SIAM J. Comput, vol.28, issue.6, pp.2117-2132, 1999.

M. Sellmann, Cost-based filtering for shortest path constraints, CP'03, pp.694-708, 2003.
DOI : 10.1007/978-3-540-45193-8_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.2496

S. Sorlin and C. Solnon, A Global Constraint for Graph Isomorphism Problems, CPAIOR'04, pp.287-301, 2004.
DOI : 10.1007/978-3-540-24664-0_20

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

S. Zampelli, Y. Devilles, C. Solnon, S. Sorlin, and P. Dupont, Filtering for Subgraph Isomorphism, CP'07, pp.728-742, 2007.
DOI : 10.1007/978-3-540-74970-7_51
URL : https://hal.archives-ouvertes.fr/hal-01502145