An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching

Documenti analoghi

• Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG
  di: Yuan, Haonan, et al.
  Pubblicazione: (2026)
• Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
  di: Jiang, Zite, et al.
  Pubblicazione: (2020)
• An Analysis on Matching Mechanisms and Token Pruning for Late-interaction Models
  di: Liu, Qi, et al.
  Pubblicazione: (2024)
• CDFGNN: a Systematic Design of Cache-based Distributed Full-Batch Graph Neural Network Training with Communication Reduction
  di: Zhang, Shuai, et al.
  Pubblicazione: (2024)
• Efficient Recommendation with Millions of Items by Dynamic Pruning of Sub-Item Embeddings
  di: Petrov, Aleksandr V., et al.
  Pubblicazione: (2025)