Computational experiences with some transitive closure algorithms

DOI10.1007/BF02252834zbMath0336.05003MaRDI QIDQ1229720

J. Dzikiewicz, Maciej M. Sysło

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ Computational experiences with some transitive closure algorithms ⋮ On computing the transitive closure of a relation ⋮ An improved transitive closure algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An algorithm for computing all paths in a graph
• A transitive closure algorithm
• The Transitive Reduction of a Directed Graph
• Depth-First Search and Linear Graph Algorithms
• A fast expected time algorithm for Boolean matrix multiplication and transitive closure
• A Theorem on Boolean Matrices

This page was built for publication: Computational experiences with some transitive closure algorithms