From ee3f63247fbd6785550dd1c63baca89a9f8873a4 Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Fri, 27 Sep 2013 20:01:33 +0200 Subject: m readme MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- README | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README b/README index a8b89ba..92df369 100644 --- a/README +++ b/README @@ -2,13 +2,13 @@ also known as the Hungarian method, Kuhn–Munkres algorithm or Munkres assignment. -The Hungarian algorithm solved the minmum bipartite -match problem in 𝓞(n⁴). By implementing the priority +The Hungarian algorithm solves the minmum 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 bounded within the priority queue's capacity. -However this implemention achived 𝓞(n³) by not using +However this implemention achives 𝓞(n³) by not using a priority queue. Edmonds and Karp, and independently Tomizawa, has -- cgit v1.2.3-70-g09d2