Results 71 to 80 of about 3,015 (169)

Dominating induced matchings and other graph parameters

AKCE International Journal of Graphs and Combinatorics
A matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist,
A. Mahmoodi, A. Behmaram, T. Došlić, N. Asadi   +3 more
doaj   +1 more source

On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory

Journal of Computational and Graphical Statistics
The subgraph-subgraph matching problem is, given a pair of graphs and a positive integer $K$, to find $K$ vertices in the first graph, $K$ vertices in the second graph, and a bijection between them, so as to minimize the number of adjacency disagreements across the bijection; it is ``seeded" if some of this bijection is fixed.
Meng, Lingyao, Lou, Mengqi, Lin, Jianyu, Lyzinski, Vince, Fishkind, Donniell E.   +4 more
openaire   +2 more sources

Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph

Frontiers in Big Data
IntroductionTraditional Graph Pattern Matching (GPM) research mainly focuses on improving the accuracy and efficiency of complex network analysis and fast subgraph retrieval. Despite their ability to return subgraphs quickly and accurately, these methods
Houdie Tu, Lei Li, Lei Li, Zhenchao Tao, Zhenchao Tao, Zan Zhang, Zan Zhang   +6 more
doaj   +1 more source

GPU-Accelerated Batch-Dynamic Subgraph Matching

2024 IEEE 40th International Conference on Data Engineering (ICDE)
Comment: This paper has been accepted by ICDE ...
Qiu, Linshan, Chen, Lu, Jie, Hailiang, Ke, Xiangyu, Gao, Yunjun, Liu, Yang, Zhang, Zetao   +6 more
openaire   +2 more sources

Subgraph Matching for Single Large Multigraphs Subgraph Matching for Single Large Multigraphs

, 2014
Nowadays, many real world data can be represented by a network with a set of nodes interconnected with each other by multiple relations (multiple edges). Such a rich graph, called multigraph, is very appropriate to represent real world scenarios with complex interactions. However, performing sub-multigraph query on enriched graph is still an open issue
openaire   +1 more source

GMFOLD: Subgraph matching for high-throughput DNA-aptamer secondary structure classification and machine learning interpretability. [PDF]

Math Biosci
Climaco P, Mitchell NM, Tyler MJ, Yang K, Andrews AM, Bertozzi AL.   +5 more
europepmc   +1 more source

Neural subgraph counting on stream graphs via localized updates and monotonic learning. [PDF]

PLoS One
Xie Z, Hou W, Wu F, Xu H.
europepmc   +1 more source

Prediction of Protein-Ligand Binding Affinities Using Atomic Surface Site Interaction Points. [PDF]

J Chem Inf Model
Zator KJ, Storer MC, Hunter CA.
europepmc   +1 more source

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

Nat Commun
Zhang Y, Zhou S, Wang X, Wang Z, Yang Z, Yang R, Xue Y, Li T.   +7 more
europepmc   +1 more source

Network motif detection using hidden markov models. [PDF]

Sci Rep
Bampos C, Megalooikonomou V.
europepmc   +1 more source