An improved transitive closure algorithm

DOI10.1007/BF02242140zbMath0504.68042OpenAlexW198808598MaRDI QIDQ1836309

Lothar Schmitz

Publication date: 1983

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242140

zbMATH Keywords

digraphsstrongly connected componentstransitive reduction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ An efficient transitive closure algorithm for cyclic digraphs ⋮ Finite sets of data compatible with multidimensional inequality measures ⋮ Minimizing cost travel in multimodal transport using advanced relation transitive closure ⋮ On finding the strongly connected components in a directed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sensitive transitive closure algorithm
• An algorithm for finding the transitive closure of a digraph
• Computational experiences with some transitive closure algorithms
• Efficient determination of the transitive closure of a directed graph
• On computing the time complexity of transitive closure algorithms
• A transitive closure algorithm
• The Transitive Reduction of a Directed Graph
• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices

This page was built for publication: An improved transitive closure algorithm