The input/output complexity of transitive closure
type: Item
instance of: scholarly article
title: The input/output complexity of transitive closure
zbMATH Open document ID: 0875.68239
DOI: 10.1007/BF01530929
author: Jeffrey D. Ullman
author: Mihalis Yannakakis
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-10-26T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1036986
zbMATH Keywords: transitive closure
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q5513488
cites work: Matrix multiplication via arithmetic progressions
cites work: Dividing a Graph into Triconnected Components
cites work: Organizing matrices and matrix operations for paged memory systems
cites work: A modification of Warshall's algorithm for the transitive closure of binary relations
cites work: A Theorem on Boolean Matrices
description: scientific article; zbMATH DE number 1036986