Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Theoretical Computer Science , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
This paper overviews monads in 2-categories and defines two new double categories of monads extending Lack and Street's 2-categories of monads.
citing papers explorer
-
Monads in 2-categories
This paper overviews monads in 2-categories and defines two new double categories of monads extending Lack and Street's 2-categories of monads.