Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 (maximum number) non overlapping cycles, 0-1-2 and 4-5-6.
Any idea of how to solve this problem efficiently ?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Graph problem.
Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 (maximum number) non overlapping cycles, 0-1-2 and 4-5-6.
Any idea of how to solve this problem efficiently ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 | zephyr_23 | 2018-05-18 09:01:02 | 55 | Tiny change: 'd 4-5-6.\n' -> 'd 4-5-6.\n\nAny idea of how to solve this problem efficiently ?\n' | ||
en4 | zephyr_23 | 2018-05-17 23:11:24 | 17 | Tiny change: 'an have 2 non overl' -> 'an have 2 (maximum number) non overl' | ||
en3 | zephyr_23 | 2018-05-17 23:10:48 | 48 | |||
en2 | zephyr_23 | 2018-05-17 23:10:23 | 87 | |||
en1 | zephyr_23 | 2018-05-17 23:09:00 | 266 | Initial revision (published) |
Name |
---|