Edge-level multi-constranint graph pattern matching with lung cancer knowledge graph
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 are limited to their applications without med...
Saved in:
Main Authors: | Houdie Tu, Lei Li, Zhenchao Tao, Zan Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2025-02-01
|
Series: | Frontiers in Big Data |
Subjects: | |
Online Access: | https://www.frontiersin.org/articles/10.3389/fdata.2025.1546850/full |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The matching polynomial of a distance-regular graph
by: Robert A. Beezer, et al.
Published: (2000-01-01) -
Some general classes of comatching graphs
by: E. J. Farrell, et al.
Published: (1987-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01) -
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
by: Sebastian Pardo-Guerra, et al.
Published: (2025-01-01)