Results 11 to 20 of about 3,671,469 (355)
Interval-Valued Fuzzy Soft Graphs
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +2 more sources
Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina Kemmar, Yahia Lebbah, S. Loudni
semanticscholar +3 more sources
Learning semantic program embeddings with graph interval neural network [PDF]
Learning distributed representations of source code has been a challenging task for machine learning models. Earlier works treated programs as text so that natural language methods can be readily applied.
Yu Wang +3 more
semanticscholar +1 more source
[Formula: see text]-labeling problem ([Formula: see text]-[Formula: see text]) is an important topic in discrete mathematics due to its various applications, like in frequency assignment in mobile communication systems, signal processing, circuit design,
Sk. Amanathulla +2 more
doaj +1 more source
Signless Laplacian Energy of Interval-Valued Fuzzy Graph and its Applications
An interval-valued fuzzy graph (IVFG) emanates from a fuzzy graph (FG) where the membership is given in interval form. This framework give the user more flexibility in dealing with fuzzy information.
M. Romdhini +4 more
semanticscholar +1 more source
On characterizing proper max-point-tolerance graphs
Max-point-tolerance graphs (MPTG) were introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in the study of the human genome as well as in signal processing for networks. The same
Sanchita Paul
doaj +1 more source
Cleaning Interval Graphs [PDF]
We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this problem, and we prove fixed-parameter tractability of the problem with non-standard parameterization, where the parameter is the difference |V(G)|-|V(H)|, with G and H being the larger and the smaller ...
Dániel Marx, Ildikó Schlotter
openaire +3 more sources
A four-sweep LBFS recognition algorithm for interval graphs [PDF]
Graph ...
Peng Li, Yaokun Wu
doaj +1 more source
Certain operations on interval-valued picture fuzzy graphs with application
Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
doaj +1 more source
Exactly Hittable Interval Graphs
Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in $\mathcal{S}$ contains exactly one element in $\mathcal{U}'$.
S. M. Dhannya +2 more
openaire +3 more sources

