Find the minimum number of nodes to be removed to convert a graph into a tree.
number of nodes < 1e5 number of edges < 2e5
Any help, please...
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Convert a graph to a tree
Find the minimum number of nodes to be removed to convert a graph into a tree.
number of nodes < 1e5 number of edges < 2e5
Any help, please...
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | b_like_karthik | 2024-07-18 12:12:59 | 2 | Tiny change: 'odes < 1e5\nnumber of ' -> 'odes < 1e5number of ' | ||
en1 | b_like_karthik | 2024-07-18 12:12:04 | 174 | Initial revision (published) |
Name |
---|