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...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2024-08-01
|
| coleção: | Mathematics |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/2227-7390/12/16/2590 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|