Kása, Zoltán (2021) Warshall’s algorithm—survey and applications. Annales Mathematicae et Informaticae, 54. pp. 17-31. ISSN 1787-6117
|
Text
AMI_54_from17to31.pdf - Published Version Download (728kB) | Preview |
Official URL: http://doi.org/10.33039/ami.2021.08.001
Abstract
This survey presents the well-known Warshall’s algorithm, a generalization and some interesting applications: transitive closure of relations, distances between vertices in graphs, number of paths in acyclic digraphs, all paths in digraphs, scattered complexity for rainbow words, special walks in finite automata.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Warshall’s algorithm, Floyd–Warshall algorithm, paths in graphs, scattered subword complexity, finite automata |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| Depositing User: | Tibor Gál |
| Date Deposited: | 03 Jan 2022 12:07 |
| Last Modified: | 03 Apr 2023 07:32 |
| URI: | http://real.mtak.hu/id/eprint/135363 |
Actions (login required)
 |
Edit Item |
