摘要
一个债务网络的纠纷量可达n(n-1)/2,在允许外来调解的前提下,本文引入了债务向一个公共点转移的算法,使债务纠纷量不超过n-1,同时找到一个较满意解,回避了圈冲销算法所面临的寻找所有圈,所有链等NP问题,债务转移算法复杂性为o(n3)。
Debt issues of a debt network have up to n(n-1)/2 .A debt transfer algorithm that enables the issue amount of a debt network to descend to n-1 is presented,it is greatly less than n(n-1)/2 .The algorithms complexity is of o(n 3).