Results 51 to 60 of about 545,686 (65)
Preprocessing 2D data for fast convex hull computations.
PLoS ONE, 2019 This paper presents a method to reduce a set of n 2D points to a smaller set of s 2D points with the property that the convex hull on the smaller set is the same as the convex hull of the original bigger set.
Oswaldo Cadenas, Graham M Megson
doaj +1 more source
Convex compact family of polynomials and its stability [PDF]
Opuscula Mathematica, 2005 Let \(P\) be a set of real polynomials of degree \(n\). Set \(P\) can be identified with some subset \(P\) of \(\mathbb{R}^n\) consists of vectors of coefficients of \(P\).
Michał Góra
doaj
About One Class of Operators Inclusions
Моделирование и анализ информационных систем, 2015 The operator inclusion 0 ∈ A(x)+N(x) is studied. The main results refer to the case, when A – a bounded operator of monotone type from a reflexive space into conjugate to it, N – a conevalued operator. No solution criterion of the viewed inclusion is set
N. A. Demyankov, V. S. Klimov
doaj +1 more source
Weakly toll convexity and proper interval graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent vertices $x,y \in S$
Mitre C. Dourado +3 more
doaj +1 more source
Mathematics, 2019 In this paper, we establish Hyers−Ulam−Rassias stability results belonging to two different set valued functional equations in several variables, namely additive and cubic. The results are obtained in the contexts of Banach spaces.
Parbati Saha +4 more
doaj +1 more source
Some Remarks on Smooth Mappings of Hilbert and Banach Spaces and Their Local Convexity Property
AxiomsWe analyze smooth nonlinear mappings for Hilbert and Banach spaces that carry small balls to convex sets, provided that the radii of the balls are small enough.
Yarema A. Prykarpatskyy +3 more
doaj +1 more source
The convex domination subdivision number of a graph
Communications in Combinatorics and Optimization, 2016 Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a dominating set of $G$ if every vertex in $V\setminus D$ has at least one neighbor in $D$. The distance $d_G(u,v)$ between two vertices $u$ and $v$ is the length of a shortest $(u,v)$-
M. Dettlaff +3 more
doaj +1 more source
Walrasian economy and some properties of convexly compact sets
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 G. Žitković defined the notion of a convexly compact set in a topological space and, among other things, used it to give an extension of the Walrasian excess-demand theorem.
Cristea Mirela +2 more
doaj +1 more source
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
Computer Science Journal of Moldova, 2020 In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
Weakly convex and convex domination numbers [PDF]
Opuscula Mathematica, 2004 Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj