Results 281 to 290 of about 187,749 (326)
Approximating Vertex Cover on Dense Graphs (Evolutionary Advancement in Fundamental Theories of Computer Science)openaire
HIBMatch: Hypergraph Information Bottleneck for Semi-Supervised Alzheimer's Progression. [PDF]
IEEE J Biomed Health InformDeng Z +4 more
europepmc +1 more source
QSAR analysis of drugs using graph based degree based topological indices and regression models. [PDF]
Sci RepMufti ZS +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The average size of a connected vertex set of a graph—Explicit formulas and open problems
Journal of Graph Theory, 2020Although connectivity is a basic concept in graph theory, the enumeration of connected subgraphs of a graph has only recently received attention. The topic of this paper is the average order of a connected induced subgraph of a graph.
A. Vince
semanticscholar +1 more source
AGCA: An Adaptive Graph Channel Attention Module for Steel Surface Defect Detection
IEEE Transactions on Instrumentation and Measurement, 2023Surface defect detection is an important part of the steel production process. Recently, attention mechanisms have been widely used in steel surface defect detection to ensure product quality.
Xin Xiang +5 more
semanticscholar +1 more source
A rough set method for the vertex cover problem in graph theory
Journal of Intelligent & Fuzzy Systems, 2016In this paper, we first establish a Multi-Relation Granular Computing model by a given graph, and point out that all the reducts of the constructed Multi-Relation Granular Computing model are exactly all the minimal vertex covers of the corresponding graph.
Qingyuan Xu, Anhui Tan, Jinjin Li 0001
openaire +1 more source
More odd graph theory from another point of view
Discrete Mathematics, 2017The Kneser graph K ( n , k ) has as vertices all k -element subsets of [ n ] = { 1 , 2 , … , n } and an edge between any two vertices that are disjoint. If n = 2 k + 1 , then K ( n , k ) is called an odd graph. Let n > 4 and 1 k n 2 .
S. Mirafzal
semanticscholar +1 more source
[Most frequent themes in Editorials of Vertex journal (1990-2019) analyzed by graph theory].
Vertex (Buenos Aires, Argentina), 2022The analysis of Editorials is a little explored topic, which can facilitate the understanding of historical processes and changes in Psychiatry. In the case of de Vertex Revista Argentina de Psiquiatría, the Editorials were written by the same person for 30 years. The most frequently used thematic areas were studied, using graph theory, to characterize
Daniel, Matusevich +3 more
openaire +1 more source