scientific article; zbMATH DE number 88951

MaRDI QIDQ4016528zbMATH OpenFDO

Authors Anestis A. Toptsis, Clement Yu, Peter C. Nelson

Publication date 16 January 1993

zbMATH Keywords

0-1 matrixalgorithmssymmetric binary relationsymmetric matrixtransitive closureWarren's algorithm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
• An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
• scientific article; zbMATH DE number 813252
• Efficient computation of transitive closures
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices

Cited in

(8)

• Efficient transitive closure of sparse matrices over closed semirings
• Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
• Using the matrix to solve the closure of relations
• scientific article; zbMATH DE number 4092728 (Why is no real title available?)
• Warshall's algorithm-survey and applications
• A reflexive matrix contracting based square algorithm for calculating the transitive closure of a Boolean matrix
• Performance evaluation of algorithms for transitive closure
• Mantaining dynamic matrices for fully dynamic transitive closure

This page was built for publication:

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