On directed densest subgraph discovery
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
Drug Repurposing for the Treatment of COVID‐19: A Knowledge Graph Approach
Identifying effective drug treatments for COVID‐19 is essential to reduce morbidity and
mortality. Although a number of existing drugs have been proposed as potential COVID‐19 …
mortality. Although a number of existing drugs have been proposed as potential COVID‐19 …
MOSER: Scalable Network Motif Discovery using Serial Test
Given a graph G, a motif (eg, 3-node clique) is a fundamental building block for G. Recently,
motif-based graph analysis has attracted much attention due to its efficacy in tasks such as …
motif-based graph analysis has attracted much attention due to its efficacy in tasks such as …
ZeroEA: A Zero-Training Entity Alignment Framework via Pre-Trained Language Model
Entity alignment (EA), a crucial task in knowledge graph (KG) research, aims to identify
equivalent entities across different KGs to support downstream tasks like KG integration, text …
equivalent entities across different KGs to support downstream tasks like KG integration, text …
M-cypher: A gql framework supporting motifs
Graph databases witness the rise of Graph Query Language (GQL) in recent years, which
enables non-programmers to express a graph query. However, the current solution does not …
enables non-programmers to express a graph query. However, the current solution does not …
From Motif to Path: Connectivity and Homophily
While motif has been widely employed in graph analytics, a fundamental question remains
open: How should overlapping motif edges connect into a path? Existing works address this …
open: How should overlapping motif edges connect into a path? Existing works address this …
[HTML][HTML] BDAC: Boundary-Driven Approximations of K-Cliques
B Çalmaz, BE Bostanoğlu - Symmetry, 2024 - mdpi.com
Clique counts are crucial in applications like detecting communities in social networks and
recurring patterns in bioinformatics. Counting k-cliques—a fully connected subgraph with k …
recurring patterns in bioinformatics. Counting k-cliques—a fully connected subgraph with k …