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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2018
05101519852018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We present a complete 3D in-hand scanning system that allows users to scan objects by simply turning them freely in front of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
One solution to the timing closure problem is to perform infrequent operations in more than one cycle. Despite simplicity of the… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 7
  • figure 11
Is this relevant?
Highly Cited
2006
Highly Cited
2006
T n "0 We shall denote by Cf and C$ the closed linear manifolds spanned by { f}o and {T*'g}o, respectively; f , g being elements… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Assembling fragments from known protein structures is a widely used approach to construct structural models for new proteins. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Various forms of the so-called loop closure problem are crucial to protein structure prediction methods. Given an N- and a C… (More)
  • figure 2
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2000
2000
Many applications in the area of production and statistical estimation are problems of convex optimization subject to ranking… (More)
Is this relevant?
1995
1995
The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
There is a straightforward algorithm for computing the transitive closure of an n-node directed graph in O(log2 n) time on an… (More)
  • figure 2.1
  • figure 3.1
  • figure 4.2
  • figure 5.2
  • figure 5.4
Is this relevant?
1987
1987
Due to VLSI technological progress, algorithm- oriented array architectures, such as systolic arrays, appear to be very effective… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • figure 5
Is this relevant?