Computational experiences with some transitive closure algorithms
type: Item
instance of: scholarly article
title: Computational experiences with some transitive closure algorithms
zbMATH Open document ID: 0336.05003
DOI: 10.1007/BF02252834
author: J. Dzikiewicz
author: Maciej M. Sysło
published in: Computing
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3525135
MaRDI profile type: Publication
cites work: The Transitive Reduction of a Directed Graph
cites work: An algorithm for finding the transitive closure of a digraph
cites work: Q5616737
cites work: Q5515142
cites work: Efficient determination of the transitive closure of a directed graph
cites work: A fast expected time algorithm for Boolean matrix multiplication and transitive closure
cites work: A transitive closure algorithm
cites work: Q4049111
cites work: Depth-First Search and Linear Graph Algorithms
cites work: An algorithm for computing all paths in a graph
cites work: A Theorem on Boolean Matrices
description: scientific article; zbMATH DE number 3525135