Advertisement

Finding a minimal transitive reduction in a strongly connected digraph within linear time

  • Klaus Simon
Algorithmic Graph Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 411)

Abstract

This paper describes an algorithm for finding a minimal transitive reduction G red of a given directed graph G, where G red means a subgraph of G with the same transitive closure as G but itself not contains a proper subgraph G1 with the same property too. The algorithm uses depth-first search and two graph transformations preserving the transitive closure to achieve a time bound of O(n + m), where n stands for the number of vertices and m is the number of the edges.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    A.V. Aho, M.R. Garey and J.D. Ullman: The Transitive Reduction of a Directed Graph, SIAM J. Computing, 1 (1972), 131–137.CrossRefGoogle Scholar
  2. [2]
    S. Even: Graph Algorithms, Computer Science Press, Potomac, MD, 1979.Google Scholar
  3. [3]
    D. Harel: A linear time algorithm for finding dominators in flow graphs and related problems, seventeenth annual ACM Symposiumon theory of computing, Providence, 1985, 185–194.Google Scholar
  4. [4]
    D. Harel and R.E. Tarjan: Fast Algorithms for Finding Nearest Common Ancestors, SIAM J. Computing 13 (1984), 339–355.CrossRefGoogle Scholar
  5. [5]
    H.T. Hsu: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph, J. ACM 22 (1975), 11–16.CrossRefGoogle Scholar
  6. [6]
    T. Lengauer a. R.E. Tarjan: A fast algorithm for finding dominators in a flowgraph. ACM transactions on programming languages a. systems, 1 (1979), 121–141.CrossRefGoogle Scholar
  7. [7]
    K. Mehlhorn: Data Structures and Algorithms, Vol. 2: Graph Algorithms and NP-Completeness, Springer, EATCS Monographs in Computer Science, 1984.Google Scholar
  8. [8]
    K. Mehlhorn and B. H. Schmidt: On BF-Orderable Graphs Discrete Applied Mathematics 15(1986), 315–327CrossRefGoogle Scholar
  9. [9]
    D.M. Moyles and G.L. Thompson: Finding a minimum equivalent graph of a digraph, J. ACM 16 (1969), 455–460.CrossRefGoogle Scholar
  10. [10]
    R. Haddad, A. Schäffer: Recognizing Bellman-Ford-Orderable Graphs, Computer Science Department Stanford University, Standford, California 94305-2140.Google Scholar
  11. [11]
    S. Sahni: Computationally Related Problems, SIAM J. Computing 3 (1974), 262–279.CrossRefGoogle Scholar
  12. [12]
    K. Simon: An Improved Algorithm for Transitive Closure on Acyclic Digraphs, Theoretical Computer Science 58 (1988), 325–346.CrossRefGoogle Scholar
  13. [13]
    K. Simon: On Minimum Flow and Transitive Reduction, Proceedings ICALP'88, Tampere, Lecture Notes in Computer Science, Springer-Verlag, 317, 535–560.Google Scholar
  14. [14]
    R.E. Tarjan: Depth first search and linear graph algorithms, SIAM J. Computing 1 (1972), 146–160.CrossRefGoogle Scholar
  15. [15]
    R.E. Tarjan: Finding Dominators In Directed Graphs, SIAM J. Computing 3 (1974), 62–89.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Klaus Simon
    • 1
  1. 1.Institut für Theoretische InformatikETH ZürichZürich

Personalised recommendations