A note on computing graph closures Original Research Article

This note shows that the k-closure of a graph can be computed in time proportional to the size of the output, improving on previous O(n3) algorithms.