Question

Time complexity of computing the transitive closure of a binary relation

Answer 1

Answer:

Explanation:

It is required to construct the transitive closure G+=(V,E+) ... An equivalent formulation is as follows: Given a reflexive binary relation R ... the parallel algorithm of Shiloach-Vishkin The time complexity is O(lnn) ... Journal of Parallel and Distributed Computing, December 2014. doi:10.1016/j.jpdc.2014.11.006

Answer 2

Answer:

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be. (A) O (n)

https://gateoverflow.in › gate2005-7