5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2024★ 5 cited
A Bellman-Ford algorithm for the path-length-weighted distance in graphs
R. Arnau, J. M. Calabuig, L. M. García Raffi +2
Consider a finite directed graph without cycles in which the arrows are weighted. We present an algorithm for the computation of a new distance, called path-length-weighted distanc…
math.FA2017★ 1 cited
-regular operators between Banach lattices
Enrique A. Sánchez-Pérez, Pedro Tradacete
We study the class of -regular operators between quasi-Banach lattices. In particular, a representation of this class as the dual of a certain tensor norm for Banach lattice…