Warshall's algorithm - survey and applications

  title={Warshall's algorithm - survey and applications},
  author={Zolt{\'a}n K{\'a}sa},
  • Z. Kása
  • Published 1 May 2019
  • Computer Science, Mathematics
  • ArXiv
The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this. 


The Floyd-Warshall algorithm on graphs with negative cycles
  • S. Hougardy
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 2010
It is shown that for this task many existing implementations of the Floyd-Warshall algorithm will fail because exponentially large numbers can appear during its execution.
Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
A new algorithm for this problem is developed that requires less computational effort than the Floyd–Warshall algorithm and it is shown that the basis of the algorithm is much easier to understand, which might be an advantage for educational purposes.
A Functional, Successor List Based Version of Warshall's Algorithm with Applications
A purely functional version of Warshall's algorithm for computing transitive closures is developed by combining the unfold-fold technique, relation-algebra and data refinement, which has the same runtime complexity as the traditional imperative array-based implementation.
On scattered subword complexity
  • Z. Kása
  • Mathematics, Computer Science
  • 2011
The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words when the gaps are of length from a given set.
Modified Floyd-Warshall algorithm for equal cost multipath in software-defined data center
This paper proposes a path load-balancing algorithm which utilizes a modified Floyd-Warshall All-Pairs Shortest Paths algorithm to compute and store equal cost paths information, utilizes the stored information for path selection, and maintain a real-time updates of those paths.
Computer Algorithms Introduction To Design And Analysis
Thank you for reading computer algorithms introduction to design and analysis, where people have look numerous times for their chosen readings, but end up in malicious downloads.
Kernels for acyclic digraphs
Two efficient kernels for comparing acyclic, directed graphs are proposed that have algorithmic complexity that is cubic in the size of the vertex-set and allows for length- and vertex-weighting too.
A Simple and Direct Algorithm for Computing Transitive Closure of Fuzzy Matrix
The computing transitive closure of fuzzy matrix plays an important role in fuzzy clustering.While the transitive closure of fuzzy matrix is closely linked with the transitive closure in common
A Theorem on Boolean Matrices
It is proved the validity of an algorithm whose running time goes up slightly faster than the square of d, the running times of which increase-other things being equal-as the cube of d.
Versatile string kernels
A class of string kernels that can handle a variety of subsequence-based features and an easy extension of the kernels allows for comparing run-length encoded strings with a time-complexity that is independent of the length of the original strings.