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

Klaus Simon

Browse the full WG paper archive.