Results 11 to 20 of about 5,940,643 (309)
Approximation Algorithms and Lower Bounds for Graph Burning. [PDF]
Graph Burning models information spreading in a given graph as a process such that in each step one node is infected (informed) and also the infection spreads to all neighbors of previously infected nodes. Formally, given a graph G = (V,E), possibly with edge lengths, the burning number b(G) is the minimum number g such that there exist nodes v_0,…,v_ ...
Lieskovský, M. +2 more
openaire +5 more sources
Topological structures induced by chromatic partitioning of vertex set of graphic [PDF]
This paper presents a method of constructing topologies on vertex set of a graph G induced by chromatic partition of vertex set of the graph. It introduces colour lower approximation and colour upper approximation of vertex induced subgraphs and ...
K. Lalithambigai, P. Gnanachandra
doaj +1 more source
Hybrid Technique for Detecting Extremism in Arabic Social Media Texts
Today, social media sites like Twitter provide effective platforms to share opinions and thoughts in public with millions of other users. These opinions shared on such sites influence a large number of people who may easily retweet them and accelerate ...
Israa Akram Alzuabidi +4 more
doaj +1 more source
A New Rough Set Classifier for Numerical Data Based on Reflexive and Antisymmetric Relations
The grade-added rough set (GRS) approach is an extension of the rough set theory proposed by Pawlak to deal with numerical data. However, the GRS has problems with overtraining, unclassified and unnatural results. In this study, we propose a new approach
Yoshie Ishii +2 more
doaj +1 more source
Roughness of Filters in Equality Algebras
Rough set theory is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are ...
Gholam Reza Rezaei +3 more
doaj +1 more source
Algorithms and error bounds for multivariate piecewise constant approximation [PDF]
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Davydov, Oleg
core +3 more sources
Roughness in Membership Continuous Function
In this paper, we introduce the new definition of rough membership function using continuous function and we discuss several concepts and properties of rough continuous set value functions as new results on rough continuous function and membership ...
Faraj.A. Abdunani, Ahmed.A. Shletiet
doaj +1 more source
Lower bounds for local approximation [PDF]
In the study of deterministic distributed algorithms, it is commonly assumed that each node has a unique O (log n )-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and ...
Mika Göös +2 more
openaire +4 more sources
On Topological Properties of Generalized Rough Approximation Operators [PDF]
Rough set theory is a mathematical tool for dealing with uncertain information.The core notions of rough set theory is approximation operators of approximation spaces.Pawlak approximation operators are established by using equivalence relations on the ...
LI Yan-yan, QIN Ke-yun
doaj +1 more source
Rough Semigroups in Connection with Single Valued Neutrosophi c (∈, ∈)-Ideals [PDF]
The scheme of rough sets is an effective procedure that handle ambiguous, inexact or uncertain information configuration. Rough set theory for algebraic structures like semigroups is a formal approximation space consisting of a universal set and an ...
Young Bae Jun +2 more
doaj +1 more source

