نتایج جستجو برای: separators

تعداد نتایج: 2888  

Journal: :RAIRO - Theoretical Informatics and Applications 2001

Journal: :Journal of Combinatorial Theory, Series B 2022

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...

2015
Quan Shi Shuo Yang Fangfang Jia Juan Xu

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...

2016
Ji-Hyung Han Miao Wang Peng Bai Fikile R. Brushett Martin Z. Bazant

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...

1995
Stephen Guattery Gary L. Miller

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...

2017
Florian Sikora

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...

2007
Andrew L. Haynes Clare E. Parnell Klaus Galsgaard Eric R. Priest

The heating of the solar corona is likely to be due to reconnection of the highly complex magnetic field that threads throughout its volume. We have run a numerical experiment of an elementary interaction between the magnetic field of two photospheric sources in an overlying field that represents a fundamental building block of the coronal heating process. The key to explaining where, how and h...

Journal: :Inf. Process. Lett. 2011
Anne Berry Romain Pogorelcnik

We present a simple unified algorithmic process which uses either LexBFS or MCS on a chordal graph to generate the minimal separators and the maximal cliques in linear time in a single pass.

200420052006200720082009201020112012201320142015201620172018201920202021202220230100200300

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید