Timeline for Max flow with minimal requirements algo problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2014 at 19:30 | comment | added | Eramol | @BenBarber It is stated in the algorithm (see paper here ), that if there is no feasible solution, the edges from/to S'/T' will not be saturated. But here it's not the case. Existence of one legal flow is not enough. Imagine the graph above with one more edge without requirements - that's a one legal flow you needed. | |
| S Dec 11, 2014 at 11:23 | history | suggested | Ben Barber |
top-level and other tags
|
|
| Dec 11, 2014 at 10:41 | comment | added | Ben Barber | One obvious problem is that there are no legal flows through that graph. Does the algorithm perhaps require the existence of at least one legal flow? What presentation of the algorithm are you working from? | |
| Dec 11, 2014 at 10:37 | review | Suggested edits | |||
| S Dec 11, 2014 at 11:23 | |||||
| Dec 10, 2014 at 10:36 | history | edited | Eramol | CC BY-SA 3.0 |
added 3 characters in body
|
| Nov 28, 2014 at 15:48 | history | edited | Joonas Ilmavirta | CC BY-SA 3.0 |
Included the linked image.
|
| Nov 28, 2014 at 15:35 | review | First posts | |||
| Nov 28, 2014 at 15:40 | |||||
| Nov 28, 2014 at 15:32 | history | asked | Eramol | CC BY-SA 3.0 |