3.7.60. Convex bipartite graph

Denotes the fact that, for a given constraint, its filtering algorithm can take advantage of the fact that we have a convex bipartite graph. A bipartite graph G=(U,V,E) is called convex according to its second set of vertices V if there is an ordering on V such that, for any vertex u of U, the neighbours of u form an interval in the previous ordering. Some graph algorithms or some problems become simpler in the context of a convex bipartite graph.