diff options
| author | Mattias Andrée <maandree@operamail.com> | 2012-11-06 15:10:23 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2012-11-06 15:10:23 +0100 |
| commit | 2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408 (patch) | |
| tree | 033410a0cd9a97981c130acbb58dc1e0615d5bfb | |
| parent | extend the readme (diff) | |
| download | hungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.gz hungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.bz2 hungarian-algorithm-n3-2b0ea3a5e6b2aefeaf6ca3b0077b4d4953cea408.tar.xz | |
...
Diffstat (limited to '')
| -rw-r--r-- | README | 5 |
1 files changed, 5 insertions, 0 deletions
@@ -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. + |