tag:blogger.com,1999:blog-1953325079793449971.post4840586062040487056..comments2024-09-20T21:17:15.980+02:00Comments on Algorithms Weekly by Petr Mitrichev: A run twice weekPetr Mitrichevhttp://www.blogger.com/profile/00138130656174416711noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-1953325079793449971.post-8516411094973063872023-12-31T17:14:19.957+01:002023-12-31T17:14:19.957+01:00I took a lot of time for problem F since there'...I took a lot of time for problem F since there's just so many different possible approaches: (approximate) diameter, cycles, components, ... . Eventually my solution was to add 5 edges between 4 largest-degree vertices. On the second run, I can check for (4th vertex's degree > 5th) and there are at least 5 out of possible 6 edges between the 4 top vertices. Now that I had more time to think, maybe dealing with cliques is possible, but I couldn't work out the probability.??https://google.comnoreply@blogger.com