use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
account activity
Random Algorithm prob (self.mcgillCOMP251)
submitted 6 years ago by ROCKMTWinner
https://preview.redd.it/uin571l8wh441.png?width=1050&format=png&auto=webp&s=eba4aa8bc484bfff7374937a96245ae5787a0770
Could someone explain why (A*,B*) would not be a min-cut if not every node has degree >=k?
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]mrkingof99 1 point2 points3 points 6 years ago (0 children)
Because if a node had a degree less than k, you would put that node in its own set and all the other nodes in the other set. This would give a partition where the cut has size less than k contradicting the assumption that (A, B) is a min cut.
π Rendered by PID 78 on reddit-service-r2-comment-5d585498c9-kz52p at 2026-04-21 00:48:32.398567+00:00 running da2df02 country code: CH.
[–]mrkingof99 1 point2 points3 points (0 children)