.png){kind=icon}
Return
Portable network resolving huge-graph isomorphism problem
.png){kind=icon}
OA
AI
DOI：10.1088/2632-2153/ad7d5f.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The graph isomorphism, as a key task in graph data analysis, is of great significance for the understanding, feature extraction, and pattern recognition of graph data. The best performance of traditional methods is the quasi-polynomial time complexity, which is infeasible for huge graphs. This paper aims to propose a lightweight graph network to resolve the problem of isomorphism in huge graphs. We propose a partitioning algorithm with linear time complexity based on isomorphic necessary condition to handle network graphs that cannot be fully computed by a single computer. We use anti-weight convolution analysis and skip connections to obtain a more stable representation with fewer layers and parameters. We implement simulations on personal computer (PC) with graphs consisting of hundred millions of edges, demonstrating the identification performance ( >98%) and time efficiency.
Keywords:
portable network
huge-graph isomorphism problem
graph partition
graph representation
Journal
M
IF:
4.6
Papers:
1.1K
Citations:
3.4K
Organization
Cited Papers
ShareSaveShareSaveEffects of polymer micro-structures on the thermo-optical properties of a flexible soft-mater film based on liquid crystals / polymer composite.png)
Polymer
PolymerIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more