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

Klaus Simon. Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG 89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings. Volume 411 of Lecture Notes in Computer Science, pages 245-259, Springer, 1989.

Abstract

Abstract is missing.