نتایج جستجو برای: point set
تعداد نتایج: 1117894 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
In this article, we consider the problem of computing minimum dominating set for a given set S of n points in R. Here the objective is to find a minimum cardinality subset S of S such that the union of the unit radius disks centered at the points in S covers all the points in S. We first propose a simple 4-factor and 3-factor approximation algorithms in O(n log n) and O(n logn) time respectivel...
We present Nonstandard Analysis by three axioms: the Extension, Transfer and Saturation Principles in the framework of the superstructure of a given innnite set. We also present several applications of this axiomatic approach to point-set topology. Some of the topological topics such as the Hewitt realcompactiication and the nonstandard characterization of the sober spaces seem to be new in the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید