Small node separators for large graphs are used in a variety of ways, from divide-andconquer algorithms to efficient route planning algorithms. We present a new algorithm for finding small k-way node separators on connected undirected graphs. We use an evolutionary algorithm to combine different separators in order to generate improved offsprings with locally good parts of both parent separator...

background and aims. the purpose of this study was to evaluate initial force and force decay of commercially available elastomeric ligatures and elastomeric separators in active tieback state in a simulated oral environment. materials and methods. a total of 288 elastomeric ligatures and elastomeric separators from three manufacturers (dentaurum, rmo, 3m unitek) were stretched to 100% and 150% ...

Mineral product, waste concrete (fine aggregates), waste in the optical field, industry, and construction employ separators to separate solids and classify them according to their size. Various sorting machines are used in the industrial field such as those operating under electrical properties, centrifugal force, wind power, vibration, and magnetic force. Study on separators has been carried o...

This paper describes a new method for unsupervised grammar induction based on the automatic extraction of certain patterns in the texts. Our starting hypothesis is that there exist some classes of words that function as separators, marking the beginning or the end of new constituents. Among these separators we distinguish those which trigger new levels in the parse tree. If we are able to detec...

An imprecise point is a point p with an associated imprecision region Ip indicating the set of possible locations of the point p. We study separability problems for a set R of red imprecise points and a set B of blue imprecise points in R, where the imprecision regions are axis-aligned rectangles and each point p ∈ R∪B is drawn uniformly at random from Ip. Our results include algorithms for fin...

In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...

A computer simulator is written to optimize the conditions of oil and gas separators using Hysys and Matlab software. Off gases in some wellhead equipment of south of Iran are burnt in flare. In the present paper, the separators of one of these wellheads are simulated. By changing different variables such as the plus fraction splitting methods and the temperature of separators the condition wit...