An Improved Algorithm WARSHALL

摘要：

The classical algorithm WARSHALL is an effective way to find the transitive closure of a relation. But in some cases it can be improved . The paper puts forward an improved algorithm WARSHALL which can be simplified when there are submatrix whose entries are all ls.

关键词： the algorithm WARSHALL the reverse relation set submatrix

作者: Wei Hong -Wei Sun Hui-Jie Chen Xiao-hong

作者单位: College of Computer Harbin Normal University Harbin, China College of Geography, Harbin Normal University Harbin, China

会议类型: 国际会议

会议名称: 2011 International Conference on Computer Science and Network Technology(2011计算机科学与网络技术国际会议 ICCSNT 2011)

会议地点: 哈尔滨

会议语种:英文

页码: 560-562

在线出版日期: 2011-12-24（万方平台首次上网日期，不代表论文的发表时间）