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.