Using link analysis technique with a modified shortest-path algorithm to fight money laundering

DOI10.1007/BF02829265zbMath1115.68301MaRDI QIDQ3446039

Quanwen Mai, Yunkai Chen, Zhengding Lu

Publication date: 8 June 2007

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

link analysisshortest-path algorithmfight money laundering

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• Pseudo approximation algorithms with applications to optimal motion planning

This page was built for publication: Using link analysis technique with a modified shortest-path algorithm to fight money laundering