A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs

Consider a finite directed graph without cycles in which the arrows are weighted by positive weights. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context of fraud detection. The idea is that th...

Cijeli opis

Bibliografski detalji

Glavni autori:	Roger Arnau, José M. Calabuig, Luis M. García-Raffi, Enrique A. Sánchez Pérez, Sergi Sanjuan
Format:	Artigo
Jezik:	Inglês
Izdano:	MDPI AG 2024-08-01
Serija:	Mathematics
Teme:	graph distance Bellman–Ford algorithm path-length-weighted
Online pristup:	https://www.mdpi.com/2227-7390/12/16/2590
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!