Pages that link to "Item:Q4060428"
From MaRDI portal
The following pages link to Regular Algebra Applied to Path-finding Problems (Q4060428):
Displaying 41 items.
- Hopscotch -- reaching the target hop by hop (Q406451) (← links)
- Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm (Q545325) (← links)
- Fixed-point calculus (Q674263) (← links)
- Wolfram's class IV automata and a good Life (Q807049) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Algebraic program analysis (Q832153) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm (Q846471) (← links)
- Universal algorithms for solving the matrix Bellman equations over semirings (Q889976) (← links)
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion) (Q1057068) (← links)
- Transitivity of generalized fuzzy matrices (Q1068060) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- Les éléments p-réguliers dans les dioides (Q1135373) (← links)
- Temporal constraint networks (Q1182161) (← links)
- The parallel computation of minimum cost paths in graphs by stream contraction (Q1183440) (← links)
- Algebraic structures for transitive closure (Q1238415) (← links)
- Semirings and path spaces (Q1254258) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- A calculational approach to mathematical induction (Q1391737) (← links)
- Universal numerical algorithms and their software implementation (Q1592078) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Left omega algebras and regular equations (Q1931903) (← links)
- Dijkstra, Floyd and Warshall meet Kleene (Q1941863) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Dioïds and semirings: Links to fuzzy sets and other applications (Q2372262) (← links)
- Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection (Q2489173) (← links)
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields (Q2512808) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- Z-matrix equations in max-algebra, nonnegative linear algebra and other semirings (Q3143325) (← links)
- A comparison of gaussian and gauss-jordan elimination in regular algebra (Q3954729) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- Stone Relation Algebras (Q5283207) (← links)
- Nonlinear matrix decompositions and an application to parallel processing (Q6083301) (← links)
- Relation-algebraic verification of disjoint-set forests (Q6614547) (← links)