Regular Algebra Applied to Path-finding Problems
From MaRDI portal
Publication:4060428
Cited in
(43)- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- Transitivity of generalized fuzzy matrices
- Transitive closure and related semiring properties via eliminants
- A unified framework for disambiguating finite transductions
- Les éléments p-réguliers dans les dioides
- Temporal constraint networks
- The parallel computation of minimum cost paths in graphs by stream contraction
- Algebraic structures for transitive closure
- Semirings and path spaces
- The equational logic of fixed points
- A calculational approach to mathematical induction
- Universal numerical algorithms and their software implementation
- An algebraic framework for minimum spanning tree problems
- Fast and efficient solution of path algebra problems
- Left omega algebras and regular equations
- Dijkstra, Floyd and Warshall meet Kleene
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Weighted automata computation of edit distances with consolidations and fragmentations
- Relational characterisations of paths
- Dioïds and semirings: Links to fuzzy sets and other applications
- Algorithms for non-linear and stochastic resource constrained shortest path
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields
- Components and acyclicity of graphs. An exercise in combining precision with concision
- Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings
- A comparison of gaussian and gauss-jordan elimination in regular algebra
- Hopscotch -- reaching the target hop by hop
- Efficient algorithms for solving systems of linear equations and path problems
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Stone relation algebras
- Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
- Nonlinear matrix decompositions and an application to parallel processing
- Relation-algebraic verification of disjoint-set forests
- Fixed-point calculus
- On the convergence rate of linear Datalog^ over stable semirings
- Convergence of datalog over (pre-) semirings
- Wolfram's class IV automata and a good Life
- Regular algebra applied to language problems
- Abstract abstract reduction
- Algebraic program analysis
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm
- Universal algorithms for solving the matrix Bellman equations over semirings
This page was built for publication: Regular Algebra Applied to Path-finding Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060428)
