2.5.4. Common keyword

Constraints C π‘’π‘›π‘‘π‘Ÿπ‘¦ and C π‘Žπ‘™π‘ π‘œ share one or more common keywords with a strong semantic connotation.

EXAMPLE: As an example, constraints C π‘’π‘›π‘‘π‘Ÿπ‘¦ = πšπš›πšŽπšŽ and C π‘Žπ‘™π‘ π‘œ = πšŒπš’πšŒπš•πšŽ are both graph partitioning constraints (i.e.,Β constraints that partition the vertices of a given initial digraph so that each partition corresponds to a specific pattern, a tree and a circuit in this example).