Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Paper
A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations
Abstract
An algorithm is given for computing the transitive closure of a binary relation that is represented by a Boolean matrix. The algorithm is similar to Warshall's although it executes faster for sparse matrices on most computers, particularly in a paging environment. © 1975, ACM. All rights reserved.
Related
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
Fan Zhang, Junwei Cao, et al.
IEEE TETC