论文标题
开放的代数路径问题
The Open Algebraic Path Problem
论文作者
论文摘要
代数路径问题为优化和计算机科学方面的最短路径算法提供了一个一般设置。这项工作将代数路径问题扩展到配备输入和输出边界的网络。我们表明，代数路径问题是来自双类别的映射，其水平组成是开放网络的粘合。我们引入了功能性开放矩阵，代数路径问题的功能性具有更实际的表达。
The algebraic path problem provides a general setting for shortest path algorithms in optimization and computer science. This work extends the algebraic path problem to networks equipped with input and output boundaries. We show that the algebraic path problem is functorial as a mapping from a double category whose horizontal composition is gluing of open networks. We introduce functional open matrices, for which the functoriality of the algebraic path problem has a more practical expression.
