Closure problem
id:
closure-problem-265-17215590
title:
Closure problem
text:
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 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 bein
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Closure_problem
date created:
date modified:
2020-11-25T22:13:24Z
main entity:
{"identifier":"Q5135529","url":"https://www.wikidata.org/entity/Q5135529"}
image:
fields total:
13
integrity:
13