{"version":"1.0","type":"link","title":"Closure problem - Newikis","description":"In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is the task of finding the maximum-weight or minimum-weight closure in a vertex-weighted directed graph. It may be solved in polynomial time using a…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}