E ! icient Partition-based Approaches for Diversified Top-𝐿 Subgraph Matching
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.
Liu-Yi Chen, Yucheng Hu, Zheng-Yi Yang et al.
· 0 citations