Questions tagged [programming-contest]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
3
votes
2answers
61 views

Minimally extend a tree such that there are no bridges in the new graph

We are given an undirected tree on which we should add the minimum number of edges such that there are no bridges in the new graph. An edge $e$ is a bridge if the graph with that edge removed is no ...