From ff2050b9e8ec451b613332aa87d357cf08b48108 Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Sun, 22 Feb 2026 13:42:13 +0100 Subject: m fixes MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- README | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'README') diff --git a/README b/README index 92df369..2e7db54 100644 --- a/README +++ b/README @@ -2,16 +2,16 @@ also known as the Hungarian method, Kuhn–Munkres algorithm or Munkres assignment. -The Hungarian algorithm solves the minmum bipartite +The Hungarian algorithm solves the minimum bipartite matching problem in 𝓞(n⁴). By implementing the priority queue with a van Emde Boas tree the time can be reduced to 𝓞(n³ log log n). The van Emde Boas tree -is possible to use because the elements values are +is possible to use because the element values are bounded within the priority queue's capacity. -However this implemention achives 𝓞(n³) by not using +However, this implementation achieves 𝓞(n³) by not using a priority queue. -Edmonds and Karp, and independently Tomizawa, has +Edmonds and Karp, and independently Tomizawa, have also reduced the time complexity to 𝓞(n³), but I -do not known how. +do not know how. -- cgit v1.2.3-70-g09d2