Skip to content
Open access

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

Sep 2026 · Tsinghua Science and Technology · 0 citations

TL;DR

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.

Abstract

Graph Similarity Computation (GSC) is a core task in graph analysis. However, current mainstream GNN-based similarity models still suffer from two fundamental bottlenecks. First, constrained by the inherent mechanism of recursive local aggregation, namely the 1-Weisfeiler–Lehman (1-wl) test, these models primarily measure similarity by aligning local structures, while struggling to capture long-range dependencies and overall topological configurations. Second, the simplified treatment of edge features prevents them from fully exploiting fine-grained semantic interactions between nodes. To address these challenges, this paper pro-poses Structure-Aware Collaborative Network (SAC-Net), an end-to-end framework that leverages structural information to unify global contexts with local affinities. Specifically, we design a Dynamic Structural Perception (DSP) backbone to establish a joint evolution paradigm for node, position, and edge features. By treating positional encodings as dynamic states, the model effectively captures long-range dependencies and overall topological configurations to maintain a robust global structural skeleton. Subsequently, this study introduce 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. Extensive experiments on four real-world datasets demonstrate that SAC-Net effectively integrates global and local information, leading to more accurate graph similarity measurement.

Read PDF

Similar papers

Open access Aug 2026

SimGAT: structure-aware graph attention network with multi-scale structural embedding

SimGAT, a structure-aware graph attention model built on SimRank-derived structural embeddings, is proposed, which computes structural similarity in the SimRank2Vec embedding space and injects it as a topological prior into the graph attention mechanism, enabling neighborhood aggregation to be jointly guided by node at...

Chengda Xu, Yinglong Zhang · 0 citations

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
#artificial intelligence Preprint Sep 2026

SCGFM-ART: Amortized Relational Transport for Structure-Centric Graph Foundation Models

SCGFM-ART, a structure-centric GFM framework that aligns arbitrary graphs onto a shared relational atlas via Amortized Relational Transport, achieves state-of-the-art transferability and establishes coordinate fidelity bounds, prove stability under predicted transport plans, and derive an amortized coverage bound that...

Xiao-Dong He, Xin-Cheng Wang, Zhao Kang · 1 citation
Open access Sep 2026

From Topology to Cognition: A Unified Graph-Driven Framework for Scalable Intelligent Data Mining

Modern data are increasingly represented and utilized as interconnected networks, including collaboration graphs, multi-relational user–item interactions, and schema-less knowledge graphs that support retrieval-augmented generation pipelines. While graph analytics has become a key foundation for intelligent data mining...

Yao Hu, Qian Huang · 0 citations
Book Open access Aug 2026

Beyond Structure-Driven Tuning: Cost-Aligned Graph Optimization for Approximate Nearest Neighbor Search

PIGR (Post-hoc Iterative Graph Refinement), a trace-driven framework that explicitly aligns efficiency with observed search behavior, is introduced, which delivers 1.3x-2.5x speedups at near-exact recall across diverse datasets and index families, consistently outperforming the best build-time tuned baselines.

Zhiwei Zhang, Weiguo Zheng · 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

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