Dijkstra, Floyd and Warshall meet Kleene
type: Item
instance of: scholarly article
title: Dijkstra, Floyd and Warshall meet Kleene
zbMATH Open document ID: 1259.68243
author: Peter Höfner
author: Bernhard Möller
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58760
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 16Y60
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 6148333
zbMATH Keywords: algebra
zbMATH Keywords: algorithms
zbMATH Keywords: shortest-path
zbMATH Keywords: Kleene algebra
zbMATH Keywords: semiring
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
OpenAlex ID: W2045246689
cites work: Regular Algebra Applied to Path-finding Problems
cites work: Calculating path algorithms
cites work: On a routing problem
cites work: Q3277097
cites work: An Algebra for Network Routing Problems
cites work: Q5639639
cites work: On the shortest route through a network
cites work: A note on two problems in connexion with graphs
cites work: Q4530231
cites work: Q3628775
cites work: Graphs, dioids and semirings. New models and algorithms.
cites work: Automated Reasoning in Kleene Algebra
cites work: Q5812175
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Q4362921
cites work: Q4036574
cites work: Q4037418
cites work: A Unified Approach to Path Problems
cites work: A Theorem on Boolean Matrices
DOI: 10.1007/S00165-012-0245-4
description: scientific article; zbMATH DE number 6148333