Computer Science – Data Structures and Algorithms
Scientific paper
2011-11-15
Acta Univ. Sapientia Inform. 3,2 (2011) 192--204
Computer Science
Data Structures and Algorithms
Scientific paper
The debts' clearing problem is about clearing all the debts in a group of $n$ entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic programming solution solving it and proved that it is NP-hard. In this paper we adapt the problem to dynamic graphs and give a data structure to solve it. Based on this data structure we develop a new algorithm, that improves our previous one for the static version of the problem.
No associations
LandOfFree
The debts' clearing problem: a new approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The debts' clearing problem: a new approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The debts' clearing problem: a new approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-67650