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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
MDPI AG
2024-08-01
|
| سلاسل: | Mathematics |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.mdpi.com/2227-7390/12/16/2590 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|