Algorithms for Generating Convex Sets in Acyclic Digraphs

P. Balister, S. Gerke, G. Gutin +5

A set $X$ of vertices of an acyclic digraph $D$ is convex if $X\ne \varnothing$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$. A set $X$ i…