Unverified50% confidenceFactExact time
The time complexity of the Leiden algorithm is approximately linear (O(n log n)), which gives it good scalability in engineering applications.
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedDijkstra算法配合优先队列实现时，时间复杂度可达O((V+E)logV)69% similarUnverified对于超大规模图谱，基于 Barnes-Hut 算法可实现 O(N log N) 近似力计算以优化性能69% similarUnverified在AI推理场景下，生成Token的时间通常随输出长度线性增长（O(n)）64% similarUnverifiedL2算法相对于基向量系数位长β达到O(n⁴·β·(n+β))的位复杂度，在β=O(n)时相当于O(n⁶)，而经典LLL约为O(n⁹)64% similarUnverifiedIMM算法计算复杂度为O(M²)，M为模型数量，工程实现时需在精度与实时性之间权衡61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/831933API
curl https://kongchang.com/api/v1/knowledge/claims/831933MCP
get_claim(id=831933)