article · ACM SIGACT News · 1974
Modification of Aho and Ullman's correctness proof of Warshall's algorithm
Cited by 0Open access
Abstract
Aho and Ullman's correctness proof of Warshall's algorithm (ref. 1, p. 48) is obscure and at one point incorrect. A modified version of this proof is presented.
Cite this paper
Wegner, P. (1974). Modification of Aho and Ullman's correctness proof of Warshall's algorithm. ACM SIGACT News, 6(1), 32–35. https://doi.org/10.1145/1811129.1811134
Wegner, Peter. “Modification of Aho and Ullman's correctness proof of Warshall's algorithm.” ACM SIGACT News, vol. 6, no. 1, 1974, pp. 32–35, https://doi.org/10.1145/1811129.1811134.
Wegner, Peter. 1974. “Modification of Aho and Ullman's correctness proof of Warshall's algorithm.” ACM SIGACT News 6 (1): 32–35. https://doi.org/10.1145/1811129.1811134.
Wegner, P. (1974) ‘Modification of Aho and Ullman's correctness proof of Warshall's algorithm’, ACM SIGACT News, 6(1), pp. 32–35. Available at: https://doi.org/10.1145/1811129.1811134.
@article{wegner1974modification,
title = {{Modification of Aho and Ullman's correctness proof of Warshall's algorithm}},
author = {Wegner, Peter},
journal = {ACM SIGACT News},
volume = {6},
number = {1},
pages = {32--35},
year = {1974},
doi = {10.1145/1811129.1811134}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.