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

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

Journal: :Discrete Applied Mathematics 2016
József Balogh Béla Csaba Ryan R. Martin András Pluhár

A path separator of a graph G is a set of paths P = {P1, . . . , Pt} such that for every pair of edges e, f ∈ E(G), there exist paths Pe, Pf ∈ P such that e ∈ E(Pe), f 6∈ E(Pe), e 6∈ E(Pf ) and f ∈ E(Pf ). The path separation number of G, denoted psn(G), is the smallest number of paths in a path separator. We shall estimate the path separation number of several graph families, including complet...

2007
Antoine Drouart Bela Erdelyi Bertrand Jacquot Shashikant Manikonda Jerry Nolen Antonio Villari

The Super Separator Spectrometer (S) is a device being designed for experiments with the very high intensity stable beams of LINAG, the superconducting linear accelerator of GANIL, which will be built in the framework of SPIRAL2. These beams, which will be provided in the first phase of SPIRAL2, ions with A/q = 3 can reach intensities exceeding 100 pμA for lighter ones A < 40−50 depending on th...

Journal: :Journal of the American Medical Association 1895

Journal: :Journal of Physics: Conference Series 2018

Journal: :Korean Journal of Metals and Materials 2023

Lithium-ion batteries (LIBs) have undergone countless enhancements in the past decade, mainly improvements basic components: electrodes, electrolyte, and separator. The separator, which acts as a physical barrier between two does not directly participate charge energy storage.However, it is involved safety, form factor, packaging density of LIBs. While occupies relatively less internal space th...

2013
I. P. Carter R. Kandasamy

Most of our current understanding in nuclear physics has come from using stable targets and beams. Stable nuclei represent only a small fraction of the total nuclei that can exist, but do not exhibit many of the exotic proprieties seen in nuclei far from stability, such as halos [1]. The ability to study unstable nuclei has opened up a vast new range of physics to be explored. The decay of thes...

Journal: :SIAM J. Comput. 1998
Ton Kloks Dieter Kratsch

An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.

2013
Don Sheehy

A geometric separator for a set U of n geometric objects (usually balls) is a small (sublinear in n) subset whose removal disconnects the intersection graph of U into roughly equal sized parts. These separators provide a natural way to do divide and conquer in geometric settings. A particularly nice geometric separator algorithm originally introduced by Miller and Thurston has three steps: comp...

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

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