Verified75% confidenceFactExact time
The 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.
3
Sources
75%
Confidence
Long-term
Relevance
7/19/2026
First Seen
Sources
Related Claims
Unverified匈牙利算法于1955年提出，以O(n³)时间复杂度解决二分图最优匹配问题80% similarVerifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, with a time complexity of O((V+E)logV).71% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代70% similarUnverified计算编辑距离的经典动态规划算法由 Wagner 和 Fischer 于 1974 年提出，时间复杂度为 O(m×n)68% similarUnverifiedMost modern diff tools are based on the difference algorithm proposed by Eugene Myers in 1986, which has a time complexity of O(ND).65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/563706API
curl https://kongchang.com/api/v1/knowledge/claims/563706MCP
get_claim(id=563706)