A note of the computation of the k-closure of a graph

Abstract

Bondy and Chvátal introduced the concept of k-closure of a graph and described an algorithm which constructs it in 0 (n4) steps. In this note is presented a method having complexity 0 (n³).