Download Linnk AI
•
Autonomous Research Assistant
>
Sign In
insight
-
Structural Complexity Measurement
Weisfeiler-Leman Dimension Upper Bound Analysis
The Weisfeiler-Leman dimension of a graph is bounded by 0.15n + o(n).
1
