Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Mathematics in Practice and Theory》 2007-01
Add to Favorite Get Latest Update

A Reflexive Matrix Constructing based Square Algorithm for Calculating the Transitive Closure of Boolean Matrix

GU Yun-dong~(1,2) ZHAO Feng~3(1.School of Mathematics and physics,North China Electric Power University,Beijing 102206,China)(2.School of Management Sciences,Beijing Normal University,Beijing 100875,China)(3.School of Mathematics Science,Liaocheng University,Liaocheng 252059,China)  
First,the transitive closure of general boolean matrix and it′s computing problems are discussed.Then,the relations between the transitive closure of general boolean matrix and that of the reflexive boolean matrix constructed by the union of boolean matrix and identity matrix are studied.At last,the reflexive matrix contracting based square algorithm is presented for calculating the transitive closure of the general binary relation,and the procedure of it is showed through an example.
【Fund】: 国家自然科学基金(60474023);; 973国家重大基础研究计划基金(2002CB312200);; 中国博士后科学基金(2005037316)
【CateGory Index】: O241.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved