A fast algorithm for computing transitive relation

DOI10.1080/00207169908804770MaRDI QIDQ4243275zbMATH OpenOpenAlexWikidataFDO

Authors Ping-Sung Liao, Tse-Sheng Chen, Pau-Choo Chung

Publication date 8 November 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804770

zbMATH Keywords

message passing protocolrelation matrixtransitive relation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Efficient computation of transitive closures
• scientific article; zbMATH DE number 3851094
• scientific article; zbMATH DE number 486959
• On the transitive closure of reciprocal \([0, 1]\)-valued relations

Cited in

(1)

• Algorithms for computing the optimal transitive approximation of a proximity relation

This page was built for publication: A fast algorithm for computing transitive relation

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