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...
→ Pay attention
Before contest
Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
03:05:23
Register now »
Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
03:05:23
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 7 | Petr | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/18/2024 14:29:38 (j3).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by b_like_karthik (previous revision, new revision, compare).
This problem is NP complete.
I quote from the paper "Maximum induced trees in graphs" by Paul Erdös, Michael Saks and Vera T Sós:
"The problem “given a graph H and integer k does H have an independent set of size k?” is a well-known NP-complete problem. Given H and k, let n be the number of vertices of H and let G be the graph obtained by adjoining a path on n vertices to H, one endpoint of which is joined by an edge to every vertex in H. The problem of whether H has an independent set of size k is easily seen to be equivalent to whether G has an induced tree of size n + k."
Source: https://doi.org/10.1016/0095-8956(86)90028-6
Therefore I doubt that an algorithm exists that can solve this problem for such large graphs in reasonable time.
Thank you very much