A fast expected time algorithm for Boolean matrix multiplication and transitive closure

DOI10.1016/S0019-9958(73)90228-3zbMATH Open0256.65016DBLPjournals/iandc/ONeilO73WikidataQ57309202 ScholiaQ57309202MaRDI QIDQ5671565FDOQ5671565

Authors: Patrick E. O'Neil, Elizabeth O'Neil 

Publication date: 1973

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cited In (5)

• Mathematical solution for a data processing system
• On efficiently computing the product of two binary relations
• New applications of the incompressibility method. II
• 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

This page was built for publication: A fast expected time algorithm for Boolean matrix multiplication and transitive closure

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