Results 41 to 50 of about 805,669 (72)
Antipodal Interval-Valued Fuzzy Graphs [PDF]
Concepts of graph theory have applications in many areas of computer science including data mining, image segmentation, clustering, image capturing, networks, etc . An interval-valued fuzzy set is a generalization of the notion of a fuzzy set. Interval-valued fuzzy models give more precision, flexibility and compatibility to the system as compared to ...
arxiv
Interval Graphs with Containment Restrictions [PDF]
An interval graph is proper iff it has a representation in which no interval contains another. Fred Roberts characterized the proper interval graphs as those containing no induced star $K_{1,3}$. Proskurowski and Telle have studied $q$-proper graphs, which are interval graphs having a representation in which no interval is properly contained in more ...
arxiv
METRICS FOR EVALUATING CONSISTENCY IN DISTRIBUTED DATASTORES
The subject of the paper is metrics for evaluating consistency of distributed datastore as one of main CAP-guarantees, more precisely, criteria for reliable distributed datastore. The goal of the research is investigation of the ability to develop such a
Galyna Zholtkevych
doaj +1 more source
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$. Instead, we fix a $W$ and change the underlying distribution of the coordinates $x$ and $y$.
arxiv
Unifying interval maps and branching systems with applications to relative graph C*-algebras [PDF]
We describe Markov interval maps via branching systems and develop the theory of relative branching systems, characterizing when the associated representations of relative graph C*-algebras are faithful. When the Markov interval maps $f$ have escape sets, we use our results to characterize injectivity of the associated relative graph algebra ...
arxiv
Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs [PDF]
In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and interval bigraphs.
arxiv
On hybrid order dimension [PDF]
The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked at the time.
arxiv
Graph classes equivalent to 12-representable graphs [PDF]
Jones et al. (2015) introduced the notion of $u$-representable graphs, where $u$ is a word over $\{1, 2\}$ different from $22\cdots2$, as a generalization of word-representable graphs. Kitaev (2016) showed that if $u$ is of length at least 3, then every graph is $u$-representable.
arxiv
This paper is concerned with exponential synchronization for a class of coupled neural networks with hybrid delays and stochastic distributed delayed impulses.
Gang Zhang, Yinfang Song, Xiaoyou Liu
doaj +1 more source
With the advent of employing bio-fuels along with the diesel in compression ignition engines the study of performance and emission characteristics have occupied the prominence, owing to diversified multi responses.
Syed Yousufuddin+2 more
doaj +1 more source