Results 41 to 50 of about 69 (69)

A Separator Theorem for Planar Graphs

SIAM Journal on Applied Mathematics, 1979
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than ${2n / 3}$ vertices, and C contains no more than $2\sqrt 2 \sqrt n $ vertices. We exhibit an algorithm which finds such a partition A, B, C in $O( n )$
Lipton, Richard J., Tarjan, Robert Endre
openaire   +2 more sources

Geometric separator theorems and applications

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002
We find a large number of "geometric separator theorems" such as: I: Given N disjoint isooriented squares in the plane, there exists a rectangle with /spl les/2N/3 squares inside, /spl les/2N/3 squares outside, and /spl les/(4+0(1))/spl radic/N partly in & out.
Warren D. Smith, Nicholas C. Wormald
openaire   +1 more source

The Separation Theorem

2002
Although our interest is mostly in optimal stochastic control of linear systems with a quadratic cost criterion, the topic can be discussed more clearly for a more general problem model. The general model is applicable to quite a wide variety of problems, as illustrated in [11].
openaire   +1 more source

A Separation Theorem

1993
Our mathematical travels take us next to a quite different part of topology. It is called general topology or point-set topology and it seeks to discover properties of topological spaces that hold for very broad classes of spaces. A substantial part of the subject concerns spaces that are not necessarily metric and this will be the case of the theorem ...
openaire   +1 more source

On the Separation Theorem of Stochastic Control

SIAM Journal on Control, 1968
Optimal control and filtering problem for stochastic linear dynamic system reduced to independent ...
openaire   +2 more sources

Semiprime Ideals and Separation Theorems for Posets

Order, 2008
Let \(P\) be a poset and let \(A\) be a subset of \(P\). Define \(A^{u}:=\{x\in P : x\geq a \text{ for every } a\in A\}\). Dually define \(A^{l}:=\{x\in P : x\leq a \text{ for every } a\in A\}\). Then \(A^{ul}\) means \(\{A^{u}\}^l\) and \(A^{lu}\) means \(\{A^{l}\}^u\). A subset \(I\) of \(P\) is called an ideal if \(a,b\in I\) implies that \(\{a,b\}^{
Vilas S. Kharat, Khalid A. Mokbel
openaire   +2 more sources

The Second Separation Theorems

Journal of the London Mathematical Society, 1977
openaire   +1 more source

A new staircase separator theorem

1997
The notion of staircase separator, introduced in [2], greatly facilitates the design of divide-and-conquer algorithms for problems on rectangles. We generalize the concept of staircase separator to k-perfect staircase separator, namely a set of staircase separators which partitions a set S of n axis-parallel, rectangles into k subsets of (almost) equal
openaire   +1 more source

Mean–variance efficient large portfolios: a simple machine learning heuristic technique based on the two-fund separation theorem

Annals of Operations Research, 2022
Bertrand Maillet, Costola Michele
exaly  

A Separation Theorem for Continuous Spectra

American Journal of Mathematics, 1949
Hartman, Philipp, Wintner, Aurel
openaire   +2 more sources