109
click to vote
JCT
2011
14 years 10 months ago
2011
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...