Re:Solving the minimum cut problem for undirected graphs
by vecter on Wednesday April 17, 2024 @01:25PM
(#40067661)
I doubt it. Finding faster deterministic min-cut algorithms has been an interesting problem for a long time. Programming puzzles have no practical impact on theoretical research.
[ Parent
| on HN ]
There are no comments on this comment yet.