ScholarLens Back to search
2008•Journal of the Qiannan Normal College for NationalitiesRequires access

Relation Between Computing the Transitive Closure for Binary Relation and Reachability Matrix

Xin Xiang-li

Open publisher page 0 citations

Abstract

The characteristics of solutions about the transitive closure for binary relation are analyzed.By using the relation between it and reachability matrix of graph,Warshall algorithm is adopted to computing the reachability matrix,which simplifies the computing process.

About this research paper

What this paper is about

The characteristics of solutions about the transitive closure for binary relation are analyzed.By using the relation between it and reachability matrix of graph,Warshall algorithm is adopted to computing the reachability matrix,which simplifies the computing process.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The characteristics of solutions about the transitive closure for binary relation are analyzed.By using the relation between it and reachability matrix of graph,Warshall algorithm is adopted to computing the reachability matrix,which simplifies the computing process.

Key concepts: Transitive closure, Transitive reduction, Reachability, Binary relation, Logical matrix, Transitive relation, Relation (database), Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Relation Between Computing the Transitive Closure for Binary Relation and Reachability Matrix — Research Paper | ScholarLens