Title :
An improved algorithm WARSHALL
Author :
Wei Hong-Wei ; Hui-Jie, Sun ; Xiao-hong, Chen
Author_Institution :
Coll. of Comput., Harbin Normal Univ., Harbin, China
Abstract :
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 1´s.
Keywords :
computational complexity; graph theory; matrix algebra; WARSHALL; submatrix; time complexity; transitive closure; Educational institutions; Sun; submatrix; the algorithm WARSHALL; the reverse relation set;
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4577-1586-0
DOI :
10.1109/ICCSNT.2011.6182020
