Timeline for Min cost max flow in bipartite run time
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2014 at 4:20 | comment | added | Niklas B. | Oh I see. I thought OP was saying $n = |V| = |E|$ or something :) Pardon my lack of reading comprehension | |
| Mar 19, 2014 at 4:09 | comment | added | Falk Hüffner | The Hungarian algorithm solves the problem in O(k^3) for a kxk matrix. Here, we have k = |V| and n := |E| = O(k^2). I guess this could be a bit confusing since in this question n means something different than normally in graph problems. | |
| Mar 18, 2014 at 22:08 | comment | added | Niklas B. | What algorithm would one use to solve this in $O(n^{1.5})$? | |
| Nov 4, 2012 at 17:40 | review | First posts | |||
| Nov 7, 2012 at 10:48 | |||||
| Nov 4, 2012 at 17:24 | history | answered | Falk Hüffner | CC BY-SA 3.0 |