A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.

Ingo Schiermeyer

Browse the full WG paper archive.