We show that graphs do not contain a theta, pyramid, prism, or turtle as an induced subgraph have polynomially many minimal separators. This result is the best possible in sense there are with exponentially separators if only three of four subgraphs excluded. As consequence, polynomial time algorithm to solve maximum weight independent set problem for class (theta, turtle)-free graphs. Since ev...

OBJECTIVE Pain caused by orthodontic treatment can affect patient's compliance and even force them to terminate treatments. The aim of this meta-analysis is to evaluate of the analgesic effect of low level laser therapy (LLLT) after placement of the orthodontic separators. METHODS Five databases: PubMed, Embase, Cochrane library, China Biology Medicine disc (SinoMed CBM), China National Knowl...

It is shown that surface conduction can stabilize electrodeposition in random, charged porous media at high rates, above the diffusion-limited current. After linear sweep voltammetry and impedance spectroscopy, copper electrodeposits are visualized by scanning electron microscopy and energy dispersive spectroscopy in two different porous separators (cellulose nitrate, polyethylene), whose surfa...

Stephen Guattery Gary L. Miller Abstract Computing graph separators is an important step in many graph algorithms. A popular technique for computing graph separators involves spectral methods. However, there is not much theoretical analysis of the quality of the separators produced by spectral methods; instead it is usually claimed that such methods \work well in practice." We present an initia...

Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the potential maximal cliques, and then performing dynamic programming based on those structures [1, 2]. The algorithm by Fomin et al. refines the approach of Bouchitté and Todinca on some minor aspects (only considering inclusion-minimal minimal separators, trying only the so-ca...