Computational experiences with some transitive closure algorithms

DOI10.1007/BF02252834MaRDI QIDQ1229720zbMATH OpenFDO

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

Cites work

• scientific article; zbMATH DE number 3463685 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3340124 (Why is no real title available?)
• A Theorem on Boolean Matrices
• A fast expected time algorithm for Boolean matrix multiplication and transitive closure
• A transitive closure algorithm
• An algorithm for computing all paths in a graph
• 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
• The Transitive Reduction of a Directed Graph

Cited in

(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

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

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