Algorithm to simplify a weighted directed graph of debts

by

Here is an academic paper which investigates this problem in great detail. There is also some sample code for the different algorithms in Section 8 towards the end.

Verhoeff, T. (2004). Settling multiple debts efficiently : an invitation to computing science. Informatics in Education, 3(1), 105-126.

More Related Contents:

  1. Finding all cycles in a directed graph
  2. Best algorithm for detecting cycles in a directed graph [closed]
  3. Graph Algorithm To Find All Connections Between Two Arbitrary Vertices
  4. Find all paths between two graph nodes
  5. Cycles in an Undirected Graph
  6. Why doesn’t Dijkstra’s algorithm work for negative weight edges?
  7. Negative weights using Dijkstra’s Algorithm
  8. Find the shortest path in a graph which visits certain nodes
  9. Compute the minimal number of swaps to order a sequence
  10. Find the paths between two given nodes?
  11. What are the practical factors to consider when choosing between Depth-First Search (DFS) and Breadth-First Search (BFS)? [closed]
  12. Why is the time complexity of both DFS and BFS O( V + E )
  13. What are the differences between segment trees, interval trees, binary indexed trees and range trees?
  14. Why DFS and not BFS for finding cycle in graphs
  15. Why does Dijkstra’s algorithm use decrease-key?
  16. Why is depth-first search claimed to be space efficient?
  17. Number of paths between two nodes in a DAG
  18. What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?
  19. Explanation of Algorithm for finding articulation points or cut vertices of a graph
  20. Finding connected components of adjacency matrix graph
  21. Subset Sum algorithm
  22. Why is quicksort better than mergesort?
  23. Which sort algorithm works best on mostly sorted data? [closed]
  24. Natural Sorting algorithm
  25. How to delete in a heap data structure?
  26. O(klogk) time algorithm to find kth smallest element from a binary heap
  27. Calculating permutations in F#
  28. Approximate string matching algorithms
  29. Generating shuffled range using a PRNG rather than shuffling
  30. Find out which combinations of numbers in a set add up to a given total

Leave a Comment