نتایج جستجو برای: air separators
تعداد نتایج: 208416 فیلتر نتایج به سال:
The auditory system appears to begin listening to an input with a basis toward hearing the input as a single stream, but it gradually accumulates evidence over a period of seconds which may lead to the input's being split into substreams. Several seconds of silence or of unpatterned noise slowly remove the bias of the mechanism in favor of these streams. The effects were demonstrated in experim...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time i...
Correction for 'Highly lithium-ion conductive battery separators from thermally rearranged polybenzoxazole' by Moon Joo Lee et al., Chem. Commun., 2015, 51, 2068-2071.
Abstract Development of numerical methods for calculating the movement gas-dispersed flows in vortex and inertial separators, creation devices with counter tangential increased dust collection efficiency, determination optimal profile corrugated channels order to minimize release droplet moisture from separators.
An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.
In this paper we give an efficient algorithm to find all minimal vertex separators of an undirected graph. The algorithm needs polynomial time per separat.or that. is found.
We present an efficient algorithm that lists the minimal separators of a 3-connected planar graph in O(n) per separator.
We consider the largest number of minimal separators a graph on n vertices can have at most. – We give a new proof that this number is in O ((
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید