| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 162 |
| 3 | maomao90 | 161 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
a graph theory problem(maybe greedy)
Hi, all
How to find the least number of one-point-connected-subgraphs of a graph? I think we can go greedy, but how to prove greedy works?
by one-point-connected-subgraph I mean, there is at least one point that is connected to other points in the subgraph
Thanks!
