Methods › Graphs › Graph Data Augmentation › Canonical Partition
Canonical Partition
Introduced by Tianyu Fu et al. in DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
\emph{Canonical partition} 𝒫 crops the index-restricted d-hop neighborhood around the center node from the target graph. 𝒟(Gₜ,vᵢ,v_c) means the shortest distance between vᵢ and v_c on Gₜ. 𝒫(Gₜ, v_c, d) = G_c, s.t. G_c ⊆Gₜ, V_c = { vᵢ ∈Vₜ|𝒟(Gₜ,vᵢ,v_c) ≤d , vᵢ ≤v_c}
The graph G_c obtained by canonical partition is called the \emph{canonical neighborhood}. Canonical neighborhoods can correctly substitute the target graph in canonical count. The subgraph count of query in target equals the summation of the canonical count of query in canonical neighborhoods for all target nodes. Canonical neighborhoods are acquired with canonical partition 𝒫, given any d greater than the diameter of the query. 𝒞(G_q,Gₜ) = ∑_(v_c ∈Vₜ) 𝒞_c(G_q, 𝒫(Gₜ, v_c, d),v_c), d ≥max_(vᵢ, vⱼ ∈V_q) 𝒟(G_q, vᵢ, vⱼ)
Papers archive 2025-07-28
1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting 16 Aug 2023 · 1 repository · arXiv:2308.08198Syntology ran 3 of 3 samples · 0 unverified
Tasks archive 2025-07-28
4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Graph Neural Network | 1 |
| Graph Regression | 1 |
| Position | 1 |
| Subgraph Counting | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections