News for hackers. Stuff that matters.
Re:Solving the minimum cut problem for undirected graphs by JohnKemeny on Wednesday April 17, 2024 @11:18AM (#40065923)
If you settle for randomized, Karger's algorithm is amazing.

https://en.m.wikipedia.org/wiki/Karger%27s_algorithm

Re:Solving the minimum cut problem for undirected graphs by NooneAtAll3 on Wednesday April 17, 2024 @02:45PM (#40068623)
I wonder why wikipedia still hasn't implemented transfer of pc users back away from mobile version...
Re:Solving the minimum cut problem for undirected graphs by paxys on Wednesday April 17, 2024 @03:46PM (#40069291)
Why would they? Plenty of PC users prefer the m.wikipedia.org layout, even on desktop.
Re:Solving the minimum cut problem for undirected graphs by interroboink on Wednesday April 17, 2024 @07:20PM (#40071156)
I know some mobile users prefer the PC layout — but surely it would be a legitimate complaint if Wikipedia started redirecting in that direction, instead?

I think the point is: there are different sites intended for different devices, and you should get the one that matches yours (with a reasonable way to override it, of course).

Re:Solving the minimum cut problem for undirected graphs by NooneAtAll3 on Thursday April 18, 2024 @07:23AM (#40075002)
because it does redirect mobile users there

obviously it should do the same in the other direction

Re:Solving the minimum cut problem for undirected graphs by sltkr on Wednesday April 17, 2024 @06:07PM (#40070564)
The problem with Karger's algorithm isn't that it's randomized, but that even the expected runtime is orders of magnitude worse than this new deterministic algorithm.

For that reason I wouldn't call it amazing though it is an interesting algorithm.