TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS

DOI10.1142/S0219876207001102zbMath1198.68249MaRDI QIDQ3056034

Manolis Wallace, Stefanos D. Kollias

Publication date: 10 November 2010

Published in: International Journal of Computational Methods (Search for Journal in Brave)

zbMATH Keywords

complexitysparse matrixtransitive closurepartial ordering relations

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (1)

Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets

Cites Work

• Unnamed Item
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• An algorithm for computing all paths in a graph
• A transitive closure algorithm
• A Theorem on Boolean Matrices

This page was built for publication: TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS