Login / Signup

Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time.

Klaus Simon
Published in: WG (1989)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • undirected graph
  • data sets