| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Hi, can you give me a hint about this problem ??
Given a connected simple graph with n vertices and m edges, find the minimum number of operations required to remove the graph completely
in an operation you can do one of the following things:
1- remove a vertex from the graph
2- remove 2 vertices connecting to an edge
Auto comment: topic has been updated by Sookhail (previous revision, new revision, compare).
Auto comment: topic has been updated by Sookhail (previous revision, new revision, compare).
It is always optimal to perform operations of type $$$2$$$ as many times as possible. So the answer to the problem is $$$= n - $$$ maximum matching.
For a general graph, you can solve it in $$$O(n^3)$$$ and in case of a bipartite graph, you can do the same in $$$O(n \sqrt{n})$$$.