An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs

Brigitte Jaumard, Michel Minoux. An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. Inf. Process. Lett., 22(4):163-169, 1986.

Abstract

Abstract is missing.