Results 51 to 60 of about 569,019 (209)
Quasiorders, Tolerance Relations and Corresponding “Partitions” [PDF]
, 2016 The paper deals with a generalization of the notion of partition for wider classes of binary relations than equivalences: for quasiorders and tolerance relations. The counterpart of partition for the quasiorders is based on a generalization of the notion
Nowak, Marek
core +1 more source
On the Structure of Acyclic Binary Relations
, 2018 We investigate the structure of acyclic binary relations from different points of view. On the one hand, given a nonempty set we study real-valued bivariate maps that satisfy suitable functional equations, in a way that their associated binary relation is acyclic. On the other hand, we consider acyclic directed graphs as well as their representation by
Rodríguez Alcantud, José Carlos +4 more
openaire +4 more sources
Fractal and FractionalThis article presents a few fixed-point results under Matkowski-type functional contractive mapping using locally J-transitive binary relations. Our results strengthen, enhance, and consolidate numerous existent fixed-point results.
Faizan Ahmad Khan +5 more
doaj +1 more source
AIMS MathematicsThe area of metric fixed point theory applied to relational metric spaces has received significant attention since the appearance of the relation-theoretic contraction principle.
Ahmed Alamer , Faizan Ahmad Khan
doaj +1 more source
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria [PDF]
Computer Science Journal of Moldova, 2009 In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original ...
Vladimir A. Emelichev, Olga V. Karelkina
doaj
Utilizing automatically inferred invariants in graph construction and search [PDF]
, 2000 In this paper we explore the relative importance of persistent and non-persistent mutex relations in the performance of Graphplan- based planners. We also show the advantages of pre-compiling persistent mutex relations. Using TIM we are able to generate,
Fox, Maria, Long, Derek
core +1 more source
, 2020 The relational width of a finite structure, if bounded, is always (1,1) or (2,3). In this paper we study the relational width of first-order expansions of finitely bounded homogeneous binary cores where binary cores are structures with equality and some ...
Bodirsky Manuel +3 more
core +1 more source
Semigroup Forum, 1997 This paper clarifies the notion of rank of a binary relation. Indeed several definitions cohabit in the literature and two of them have never been distinguished. The main results concern the comparison of these two notions. We show that the two definitions are really different, even under strong restrictive conditions about the algebraic structure of ...
openaire +2 more sources
Neutrosophic Hypercompositional Structures defined by Binary Relations [PDF]
Neutrosophic Sets and Systems, 2014 The objective of this paper is to study neutrosophic hypercompositional structures arising from the hypercompositions derived from the binary relations on a neutrosophic set.
A.A.A. Agboola, S.A. Akinleye
doaj
Decomposing a relation into a tree of binary relations
Journal of Computer and System Sciences, 1990 AbstractWe present an efficient algorithm for decomposing an n-ary relation into a tree of binary relations and provide a simple test for checking whether or not the tree formed by the algorithm represents the relation precisely. If a tree decomposition exists, the algorithm is guaranteed to find one.
openaire +2 more sources