Login / Signup

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

Brigitte JaumardMichel Minoux
Published in: Inf. Process. Lett. (1986)
Keyphrases
  • worst case
  • transitive closure
  • space complexity
  • np hard
  • computational complexity
  • upper bound
  • database
  • similarity measure
  • machine learning
  • optimal solution
  • markov chain
  • databases
  • database systems
  • expert systems