Computational experiences with some transitive closure algorithms

DOI10.1007/BF02252834zbMATH Open0336.05003MaRDI QIDQ1229720FDOQ1229720

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

• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices
• Efficient determination of the transitive closure of a directed graph
• The Transitive Reduction of a Directed Graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• A fast expected time algorithm for Boolean matrix multiplication and transitive closure
• Title not available (Why is that?)

Cited In (4)

• An improved transitive closure algorithm
• 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

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)