Unverified50% confidenceFactExact time
匈牙利算法于1955年提出，以O(n³)时间复杂度解决二分图最优匹配问题
1
Sources
50%
Confidence
Long-term
Relevance
7/14/2026
First Seen
Sources
AI自动化OSINT实战：CS背景者的学习路径与工具选择
Related Claims
VerifiedThe Hungarian algorithm was developed by Harold Kuhn in 1955 based on the work of Dénes Kőnig and Jenő Egerváry, has a time complexity of O(n³), and is used for optimal assignment in bipartite graphs.80% similarUnverified进化算法自20世纪60年代起被用于解决复杂优化问题，由John Holland等人系统化63% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代63% similarUnverified计算编辑距离的经典动态规划算法由 Wagner 和 Fischer 于 1974 年提出，时间复杂度为 O(m×n)62% similarVerifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, with a time complexity of O((V+E)logV).62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/504071API
curl https://kongchang.com/api/v1/knowledge/claims/504071MCP
get_claim(id=504071)