An improved transitive closure algorithm
type: Item
instance of: scholarly article
title: An improved transitive closure algorithm
zbMATH Open document ID: 0504.68042
DOI: 10.1007/BF02242140
published in: Computing
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3795373
zbMATH Keywords: transitive reduction
zbMATH Keywords: digraphs
zbMATH Keywords: strongly connected components
author: Lothar Schmitz
MaRDI profile type: Publication
cites work: The Transitive Reduction of a Directed Graph
cites work: Q5616735
cites work: Q4138127
cites work: On computing the time complexity of transitive closure algorithms
cites work: Q4144755
cites work: An algorithm for finding the transitive closure of a digraph
cites work: A sensitive transitive closure algorithm
cites work: Q5616737
cites work: Q5515142
cites work: Efficient determination of the transitive closure of a directed graph
cites work: A transitive closure algorithm
cites work: Computational experiences with some transitive closure algorithms
cites work: Depth-First Search and Linear Graph Algorithms
cites work: A Theorem on Boolean Matrices
full work available at URL: https://doi.org/10.1007/bf02242140
OpenAlex ID: W198808598
description: scientific article; zbMATH DE number 3795373