Decomposition of an arbitrary set of vertices in a directed contourless graph into convex subsets

In analyzing the information interaction of MIS tasks the digraph vertices have to be decomposed into convex subsets. The notion of concavity is introduced and concave sets of graph vertices are studied; the appropriate algorithms are described. The findings may be useful in computer-aided MIS design.