Skip to content

E ! icient Partition-based Approaches for Diversified Top-𝐿 Subgraph Matching

· 0 citations · 101 references

TL;DR

The Partition-based Distance Diversity (PDD) framework is introduced, which partitions the graph and retrieves diverse matches from distant regions and two optimizations are developed: embedding-driven partition ! ltering and densest-based partition selection over a Partition Adjacency Graph.

View source

Similar papers

Preprint Aug 2026

Scalable Exact Densest P-Partite Subgraph Search in Heterogeneous Information Networks

BoxDPpS performs box-level search with safe region pruning, eliminates redundant representations of the same iRM-set, improves early pruning through bounded warm-up, and compresses each fixed-M auxiliary network for exact parametric pseudoflow solving.

Jia-Dong Xie, Jiaming Yang, Kangfei Zhao et al. · 0 citations
Open access Sep 2026

SAC-Net: Structure-Aware Collaborative Network for Graph Similarity Computation

This study introduces an Edge-Aware Fusion mechanism that leverages edge features as a bridge to adaptively integrate global and local structural information, thereby effectively addressing the alignment and integration of multi-granularity semantics.

Ling-Han Zeng, Yan-Ling Li, Ming-Xia Bi et al. · 0 citations
Jun 2026

HEXA: A Disjoint-Subgraph-Based Indexing Framework for Approximate Nearest Neighbor Search at Billion Scale

HEXA is introduced, a disjoint-subgraph-based indexing framework that partitions the dataset into disjoint clusters and constructs refined proximity subgraphs independently on GPUs and achieves up to 14.7 times higher query throughput at the same recall levels compared with various indexing methods.

Yi-Fei Xu, Yan-Yan Shen, You-Min Chen et al. · 0 citations
Preprint Sep 2026

WCCS: Efficient Wedge Conductance Community Search over Large Temporal Bipartite Graphs (Full Paper)

An online priority-driven filter-and-expand framework with several effective pruning techniques and a powerful geometric slope optimization for rapid temporal wedge conductance calculation is developed and a novel temporal wedge conductance metric is proposed that explicitly balances internal density and external spars...

Long-Long Lin, Wei Chen, Ping-Peng Yuan et al. · 0 citations
Conference Open access Sep 2026

Similarity-Guided Structural Matching Learning for Graph Dataset Condensation

Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.

Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.