Results 61 to 70 of about 27,298 (312)
An Optimization of Closed Frequent Subgraph Mining Algorithm
Cybernetics and Information Technologies, 2017 Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
IEEE Access, 2021 Social Internet of Things (SIoT) is extended to integrate social networks in the Internet of Things (IoT). SIoT enriches IoT, and thus resource (or service) discovery and consolidation in SIoT becomes an important and challenging problem.
Xiaolin Fan +4 more
doaj +1 more source
The subgraph homeomorphism problem [PDF]
Journal of Computer and System Sciences, 1978 AbstractWe investigate the problem of finding a homeomorphic image of a “pattern” graph H in a larger input graph G. We view this problem as finding specified sets of edge disjoint or node disjoint paths in G. Our main result is a linear time algorithm to determine if there exists a simple cycle containing three given nodes in G (here H is a triangle).
Andrea S. LaPaugh, Ronald L. Rivest
openaire +2 more sources
Detecting Incremental Frequent Subgraph Patterns in IoT Environments
Sensors, 2018 As graph stream data are continuously generated in Internet of Things (IoT) environments, many studies on the detection and analysis of changes in graphs have been conducted. In this paper, we propose a method that incrementally detects frequent subgraph
Kyoungsoo Bok +3 more
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1993 We are concerned with a natural generalization of the matching problem: the packing of graphs from a pregiven family. We characterize completely the complexity of deciding the existence of a perfect packing, if the pregiven family consists of two graphs, one of which is one edge on two vertices. Our results complete the work of G.
Martin Loebl, Svatopluk Poljak
openaire +1 more source
Advanced Science, EarlyView.SpaMode introduces a versatile framework for spatial multi‐omics integration across vertical, horizontal, and mosaic scenarios. By disentangling modality‐invariant and variant features through a mixture‐of‐experts mechanism, it adaptively reconfigures spatially heterogeneous signals.
Xubin Zheng +6 more
wiley +1 more source
Applied SciencesLung cancer is the most diagnosed malignant neoplasm worldwide and it is associated with great mortality. Currently, developing antineoplastic agents is a challenging, time-consuming, and costly process.
Valeria V. Kleandrova +2 more
doaj +1 more source
Advanced Science, EarlyView.SMarT‐Diff introduces a multi‐objective generative paradigm that integrates scaffold hopping with structure‐aware scoring to enable controlled exploration beyond the training distribution. The framework consistently balances drug‐likeness, synthesizes accessibility and bioactivity, yielding chemically diverse candidates with enhanced properties.
Yuwei Yang +8 more
wiley +1 more source
On Minimal Unique Induced Subgraph Queries
Applied Sciences, 2018 In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +1 more source