Live briefing
Everything about Closure problem
Computational problem in graph theory
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 being in open pit mining. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Closure problemA 5-minute orientation
- Skim a recent paper: The Revisiting Problem in Simultaneous Localization and Mapping: A Survey on Visual Loop Closure DetectionInfluential work since 2022
- Pick up a classic book: Loose EndsThe most-reprinted book on the subject
- Read the landmark paper: Development of a turbulence closure model for geophysical fluid problemsCited 5,692 times
- Go sideways: Minimum-cost flow problemA closely related topic
- Go sideways: Minimum cutA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Development of a turbulence closure model for geophysical fluid problems
THE ENERGY BALANCE CLOSURE PROBLEM: AN OVERVIEW
Some aspects of the energy balance closure problem
Closure Problem for Precipitation
On the closure problem for Darcy's law
Variational approach to the closure problem of turbulence theory
The IFRA Closure Problem
Closure problem to jet scour
🆕 Influential since 2022
The Revisiting Problem in Simultaneous Localization and Mapping: A Survey on Visual Loop Closure Detection
A probabilistic bi‐objective model for a humanitarian location‐routing problem under uncertain demand and road closure
Solution to the problem of low sensitivity of crack closure models to material properties
A hydrodynamic model for analyzing the closure stresses in the wellbore strengthening problem
Jackson R. Herring and the Statistical Closure Problem of Turbulence: A Review of Renormalized Perturbation Theories
📚 Books worth reading
Loose EndsRussell Reising · 1996- 📕Theoretical studies in support of the 3M-vapor transport (PVTOS-)experimentsDaniel E. Rosner · 1989
Cloze Passage (Cloze connections)Richard A. Boning · 1990- 📕Local and Global Methods in Algebraic GeometryNero Budur, Tommaso de Fernex · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Minimum-cost flow problem The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through…
- Minimum cut In graph theory, a minimum cut or min-cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets) that is minimal in some…
- Maximum-cardinality matching In graph theory, a maximum-cardinality matching is a special kind of subgraph useful in many computational contexts. Given a graph G, a matching is a subgraph…
- Maximum flow problem In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum…
- Assignment problem The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has…
- Widest path problem In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight…
- Hopcroft–Karp algorithm In computer science, the Hopcroft–Karp algorithm (sometimes more accurately called the Hopcroft–Karp–Karzanov algorithm) is an algorithm that takes a bipartite…
- Cut (graph theory) In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one…