Title: An algorithm for the transitive closure based on setting compound position
Abstract: There is difficulty in calculating the transitive closure of a binary relation according its definition. This paper proposes a new algorithm for the transitive closure by setting compound position of ordered pair in binary relations, incremental compound calculation being used in binary relations deleted according to the compound position of ordered pair. By this algorithm, the solution of the transitive closure can be achieved faster.
Publication Year: 2014
Publication Date: 2014-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot