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.
2016
2016
An Open-Source solution based on Pentaho is described in this paper for constructing railway passenger transport marketing… 
2014
2014
Introduction India posted an impressive growth record after economic liberalization in 1991. A slow-down during the world… 
2013
2013
We present our current work on a camera tracking algorithm designed for a mobile device equipped with a stereo camera. The… 
2011
2011
In dieser Arbeit beschAftigen wir uns mit dem Orbitabschlussproblem fUr Algebren in der Theorie der algebraischen… 
2006
2006
A voltage-island architecture for systems-on-chip is an effective way to reduce active and static power. For such multiple supply… 
2004
2004
Macroscopic transport models based on the first six moments of Boltzmann's equation are a natural extension to the drift… 
2003
2003
Sidney Nolan occupies a crucial place in the history of 20th century painting - his imagery of Ned Kelly is perhaps the best… 
2000
2000
Laboratory experiments and field observations suggest that the degeneration of basin-scale internal standing waves into packets… 
1999
1999
We are searching for the best approximation to compute fully-developed two-dimensional turbulent flows. Fluid mechanics is… 
1994
1994
A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all…