A New Algorithm for Computing the Maximal Closure of a Graph

A closure in a directed graph is a subset of nodes, all of whose successors belong to the subset. If each node has an assigned weight, which may be positive or negative, the maximal closure problem is one of finding a closure with the largest possible sum of node weights. It can be solved by any maximal flow or minimal cut algorithm. We present a new algorithm for this problem which compares favorably to maximal flow and minimal cut procedures on randomly generated classes of problems.

• 저널Management Science · 36(3) · 315–331
• 토픽Complexity and Algorithms in Graphs · Computational Theory and Mathematics
• DOI10.1287/mnsc.36.3.315
• 저자Bruce Faaland, Kiseog Kim