Great Video! Thanks ! I'm in need of implementing the algorithm to actually locate the minimal separators set of the whole graph (not just s-t). It is my understanding that this can be done by doing the s-t procedure for all possible vertex pairs and then looking at the minimal sets that arise from that. Then I'm need of implementing the s-t procedure. Now, I get that all possible paths can be found easily by solving "max flow" s-t, and I do it with matlab, but I'm curious about getting the maximally vertex independent sets of paths. I understand, from en.wikipedia.org/wiki/K-vertex-connected_graph#Computational_complexity that this can be acheived by doubling the vertex in some way, but I'm not able to figure it out on my own. Any advice ?
Great. Thank you. How did you quickly get that the size of the minimum v1-v5 separating set is 2? In other words, how can you find the separating vertices (here v4 and v10) as fast as possible? Should you check all the vertices one by one?
I got confuse if I read book about Menger's Theorem. But this video makes it simple to understand. Thanks
To the point, clean, precise video, great explanation. Helped a lot.
Great Video! Love the cleanliness of the explanation.
Thank you. I try my best.
Oh man, I came here looking for a proof. However, your work is great.
Thanks! The proof would be a little more complicated but maybe I'll add it one day.
Great Video! Thanks ! I'm in need of implementing the algorithm to actually locate the minimal separators set of the whole graph (not just s-t). It is my understanding that this can be done by doing the s-t procedure for all possible vertex pairs and then looking at the minimal sets that arise from that. Then I'm need of implementing the s-t procedure. Now, I get that all possible paths can be found easily by solving "max flow" s-t, and I do it with matlab, but I'm curious about getting the maximally vertex independent sets of paths. I understand, from en.wikipedia.org/wiki/K-vertex-connected_graph#Computational_complexity that this can be acheived by doubling the vertex in some way, but I'm not able to figure it out on my own. Any advice ?
Great video.. very intuitive. Thanks
Danke!
another min max relationship I can think of is König’s theorem for bipartite graph.
Great. Thank you.
How did you quickly get that the size of the minimum v1-v5 separating set is 2? In other words, how can you find the separating vertices (here v4 and v10) as fast as possible? Should you check all the vertices one by one?
Pretty late answer, i know, but maybe it helps others. It's fairly easy in his examples. Notice that the size of the minimum seperating set has to be
thank you so much
great explanation
Thank you
Bravo - very nice and intuitive explanation!
BTW I would be careful with showing a path of the file that contains your username ;)
Awesome video big thanks!
Glad you liked it!
where can I find the references that states the theorem you used? it is in 6:00.
excellent..!!!
thanks
No problem. Glad it was helpful.
Nice clean explanation ! :D
Thanks!
nice explanation!
big like
Thanks!
thx a lot dude
No problem. Glad you got something from it.
awesome (Y)
Like ha te is szopsz a bsz2 vizsgával és azért tévedtél ide :(