Closure problem

In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices with no outgoing edges. That is, the graph should have no edges that start within the closure and end outside the closure. 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 reduction to the maximum flow problem. It may be used to model various application problems of choosing an optimal subset of tasks to perform, with dependencies between pairs of tasks, one example being in open pit mining.

单词	Closure problem
释义	Closure problem 英语百科 Closure problem In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices with no outgoing edges. That is, the graph should have no edges that start within the closure and end outside the closure. 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 reduction to the maximum flow problem. It may be used to model various application problems of choosing an optimal subset of tasks to perform, with dependencies between pairs of tasks, one example being in open pit mining.
随便看	regardless的意思 regardlessly的意思 regardlessness的意思 regardless of的意思 regardless of expense的意思 regardless of feature size的意思 regardless of something的意思 regardless of the consequences的意思 regardless of the level of the productive forces的意思 regardless of whether的意思 regards的意思 regards as的意思 regard sb with reverence的意思 regardship的意思 regard sth with equanimity的意思 regard to的意思 regard with的意思 regard with favour的意思 regard with great detestation的意思 regarging lewis blood group的意思 regarment的意思 regarnish的意思 regarrisoned的意思 regarrisoning的意思 regas的意思