We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.

We present a new algorithm to compute small node separators on large, undirected graphs ensuring a user defined balance on the induced connected components. Our algorithm uses edge separators computed by the open source graph partitioning package KaHIP [42] and a new technique to transform them into node separators. Given an undirected graph G, our algorithm constructs a flow problem on a subgr...

The article provides a brief analysis of the internal diameter and capacity vertical gravity separator. process separation should be understood as separating solid, liquid vapor phases in stream. Devices which solid are separated from gas called separators. Separators used condensate mines divided into classes according to their different qualities. following types (classes) purpose: a) working...

We consider sparse matrices arising from nite-element or nite-diierence methods. The graphs of such matrices are embedded in two or three dimensional Euclidean space, and the coordinates of their vertices are readily available. Such coordinate information was used earlier to develop a parallel Cartesian nested dissection heuristic that computes a ll reducing ordering for a matrix with an embedd...

This paper derives a necessary and sufficient condition for robust stability of sampleddata systems, which is stated by using the notion of separators that are dealt with in an operator-theoretic framework. Such operator-theoretic treatment of separators provides a new perspective, which we call noncausal linear periodically time varying scaling and leads to reducing conservativeness in robust ...

An approach to log-linear modelling for a large contingency table is proposed in this paper. A main idea in this approach is that we group the random variables that are involved in the data into several subsets of variables with corresponding marginal contingency tables, build graphical log-linear models for the marginal tables, and then combine the marginal models using graphs of prime separat...

Separators are used to protect cathodes from biofouling and to avoid electrode short-circuiting, but they can adversely affect microbial fuel cell (MFC) performance. A spray method was used to apply a polyvinyl alcohol (PVA) separator to the cathode. Power densities were unaffected by the PVA separator (339±29mW/m(2)), compared to a control lacking a separator in a low conductivity solution (1m...

Kloks, Kratsch, and Spinrad showed how treewidth and minimum-fill, NP-hard combinatorial optimization problems related to minimal triangulations, are broken into subproblems by block subgraphs defined by minimal separators. These ideas were expanded on by Bouchitté and Todinca, who used potential maximal cliques to solve these problems using a dynamic programming approach in time polynomial in ...