On Computing the Transitive Closure of a Relation,
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon a variant of Tarjans algorithm for finding the strongly connected components of a directed graph. This variant leads to a more compact statement of Tarjans algorithm.
- Theoretical Mathematics