aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@operamail.com>2012-11-06 15:10:23 +0100
committerMattias Andrée <maandree@operamail.com>2012-11-06 15:10:23 +0100
commit2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408 (patch)
tree033410a0cd9a97981c130acbb58dc1e0615d5bfb
parentextend the readme (diff)
downloadhungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.gz
hungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.bz2
hungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.xz
...
-rw-r--r--README5
1 files changed, 5 insertions, 0 deletions
diff --git a/README b/README
index 192d9ca..62de72f 100644
--- a/README
+++ b/README
@@ -10,3 +10,8 @@ is possible to use because the elements values are
bounded within the priority queue's capacity.
However this implemention achived 𝓞(n³) by not using
a priority queue.
+
+Edmonds and Karp, and ndependently Tomizawa, has also
+reduced the time complexity to 𝓞(n³), but I do not
+known how.
+