A fast expected time algorithm for Boolean matrix multiplication and transitive closure
From MaRDI portal
Publication:5671565
DOI10.1016/S0019-9958(73)90228-3zbMath0256.65016WikidataQ57309202 ScholiaQ57309202MaRDI QIDQ5671565
Patrick E. O'Neil, Elizabeth O'Neil
Publication date: 1973
Published in: Information and Control (Search for Journal in Brave)
Related Items (5)
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ New applications of the incompressibility method. II ⋮ On efficiently computing the product of two binary relations ⋮ Computational experiences with some transitive closure algorithms ⋮ Mathematical solution for a data processing system
This page was built for publication: A fast expected time algorithm for Boolean matrix multiplication and transitive closure
