Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We study the problem that arises in a class of stochastic processes referred to as Stochastic Hybrid Systems (SHS) when computing… 
2014
2014
Introduction India posted an impressive growth record after economic liberalization in 1991. A slow-down during the world… 
2014
2014
In this paper, we present an algorithm for robot simultaneous localization and mapping (SLAM) using a Kinect sensor, which is a… 
2013
2013
This paper derives the multipoint Taylor expansion method of moments for the bimodal particle system. The collision effects are… 
2005
2005
To investigate the parameters of the protein design problem that we are exploring in collaboration with biochemists, we have… 
2000
2000
Laboratory experiments and field observations suggest that the degeneration of basin-scale internal standing waves into packets…