An improved transitive closure algorithm

DOI10.1007/BF02242140MaRDI QIDQ1836309zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A sensitive transitive closure algorithm
• A Theorem on Boolean Matrices
• A transitive closure algorithm
• An algorithm for finding the transitive closure of a digraph
• Computational experiences with some transitive closure algorithms
• Depth-First Search and Linear Graph Algorithms
• Efficient determination of the transitive closure of a directed graph
• scientific article; zbMATH DE number 3566160 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• scientific article; zbMATH DE number 3340124 (Why is no real title available?)
• On computing the time complexity of transitive closure algorithms
• The Transitive Reduction of a Directed Graph

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836309)