Graph Iso/Auto-morphism: A Divide-&-Conquer Approach
Summary: Introduces DviCL, divide-and-conquer labeling using the k-th minimum permutation; builds AutoTree to preserve automorphisms. Enables efficient automorphism-group and SSM; root labeling derives from child labels, beating state-of-the-art on 22 graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Can Lu
- 2. Jeffrey Xu Yu
- 3. Zhiwei Zhang
- 4. Hong Cheng
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 764 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017018712 |
| 847 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015993322 |
| 1,652 | Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study | 2017 | SIGMOD | 0.00011010086 |
Previous
Page 1 / 1
Next