Verified80% confidenceFactExact time
The Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.
4
Sources
80%
Confidence
Long-term
Relevance
7/19/2026
First Seen
Sources
Related Claims
UnverifiedBinary search locates an element in a sorted array in only O(log n) comparisons, and the search and insertion operations of a balanced binary search tree also have O(log n) time complexity.71% similarUnverifiedFor graphs with small integer edge weights, Dial's Algorithm (a bucket-sort approach) can reduce the complexity to O(m + C), where C is the maximum edge weight.70% similarUnverified标准多头注意力中每个Token需与序列中所有其他Token计算相关性权重，计算复杂度为O(N²)69% similarUnverified非原生图数据库需通过全局索引查找相邻节点，时间复杂度随图规模增长为O(log n)甚至O(n)69% similarUnverified当两名标注员标注物体数量不同时，通常采用匈牙利算法进行最优匹配，剩余未匹配的标注计为分歧67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/558683API
curl https://kongchang.com/api/v1/knowledge/claims/558683MCP
get_claim(id=558683)