Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Closure_problem> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Closure_problem abstract "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 wikiPageID "20815865".
- Closure_problem wikiPageLength "12353".
- Closure_problem wikiPageOutDegree "23".
- Closure_problem wikiPageRevisionID "666001765".
- Closure_problem wikiPageWikiLink Binary_search_algorithm.
- Closure_problem wikiPageWikiLink Category:Combinatorial_optimization.
- Closure_problem wikiPageWikiLink Category:Graph_algorithms.
- Closure_problem wikiPageWikiLink Category:Mineral_economics.
- Closure_problem wikiPageWikiLink Combinatorial_optimization.
- Closure_problem wikiPageWikiLink Complement_(set_theory).
- Closure_problem wikiPageWikiLink Directed_acyclic_graph.
- Closure_problem wikiPageWikiLink Directed_graph.
- Closure_problem wikiPageWikiLink File:Closure.png.
- Closure_problem wikiPageWikiLink Graph_theory.
- Closure_problem wikiPageWikiLink Job_shop_scheduling.
- Closure_problem wikiPageWikiLink Max-flow_min-cut_theorem.
- Closure_problem wikiPageWikiLink Maximum_flow_problem.
- Closure_problem wikiPageWikiLink Michel_Balinski.
- Closure_problem wikiPageWikiLink Minimum_cut.
- Closure_problem wikiPageWikiLink NP-completeness.
- Closure_problem wikiPageWikiLink Open-pit_mining.
- Closure_problem wikiPageWikiLink Strongly_connected_component.
- Closure_problem wikiPageWikiLink Topological_sorting.
- Closure_problem wikiPageWikiLink Transpose_graph.
- Closure_problem wikiPageWikiLinkText "Closure problem".
- Closure_problem wikiPageWikiLinkText "closure problem".
- Closure_problem wikiPageUsesTemplate Template:Harvtxt.
- Closure_problem wikiPageUsesTemplate Template:Reflist.
- Closure_problem subject Category:Combinatorial_optimization.
- Closure_problem subject Category:Graph_algorithms.
- Closure_problem subject Category:Mineral_economics.
- Closure_problem hypernym Set.
- Closure_problem type Algorithm.
- Closure_problem type Page.
- Closure_problem comment "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.".
- Closure_problem label "Closure problem".
- Closure_problem sameAs Q5135529.
- Closure_problem sameAs m.055v0x3.
- Closure_problem sameAs Проблем_затворења.
- Closure_problem sameAs Q5135529.
- Closure_problem wasDerivedFrom Closure_problem?oldid=666001765.
- Closure_problem isPrimaryTopicOf Closure_problem.