5 citations · 5 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.FA2024
Eccentric summing Lipschitz operators and integral inequalities on metric spaces and graphs
R. Arnau, E. A. Sánchez Pérez, S. Sanjuan
The extension of the concept of summability for linear operators to the context of Lipschitz operators on metric spaces has been extensively studied in recent years. This resea…