Efficient Transitive Closure Computation in Large Digraphs

E. Nuutila

    Research output: Working paperProfessional

    Original languageEnglish
    Place of PublicationHelsinki
    Pages124
    Publication statusPublished - 1995
    MoE publication typeD4 Published development or research report or study

    Keywords

    • algorithms
    • chain decomposition
    • data structures
    • directed graphs
    • intervals
    • random graphs
    • strong components
    • tarjan's algorithm
    • transitive closure

    Cite this