Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 non overlapping cycles, 0-1-2 and 4-5-6.
Graph problem.
Given a connected, undirected graph, find maximum number of non overlapping cycles ?
Example:-
Here in the above example we can have 2 non overlapping cycles, 0-1-2 and 4-5-6.
| 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) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
