Timeline for Can not follow the example for max-flow-min-cut on Wikipedia
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2014 at 14:03 | vote | accept | joker | ||
| May 9, 2014 at 7:31 | history | edited | FrankW | CC BY-SA 3.0 |
added 16 characters in body
|
| May 4, 2014 at 7:43 | comment | added | joker | encase you miss understood at most you can push through 9 in this graph through t which is the capacity at t, the capacity at s is 7, which is the max that can be passed through the whole graph. | |
| May 4, 2014 at 7:16 | comment | added | David Richerby | I'm not sure what you mean. A "maximal" object is one that can't be added to; a "maximum" object is one that is bigger than all others. For example, vertex 1 is a maximal independent set in the graph in your question (you can't add another vertex and stil have an ind. set), whereas {s,t} is a maximum ind. set, since there is no ind. set with strictly more than two vertices. So I don't understand how you can claim that the maximal flow (9) is bigger than the maximum flow (7): that's impossible. | |
| May 3, 2014 at 8:17 | history | answered | joker | CC BY-SA 3.0 |