Timeline for Algorithms for heaviest edge-disjoint cycle collection contained in graph's set of edges
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2020 at 17:01 | comment | added | Tony Huynh | You are correct. I edited my answer accordingly to the correct reference. | |
| Mar 21, 2020 at 17:00 | history | edited | Tony Huynh | CC BY-SA 4.0 |
deleted 97 characters in body
|
| Mar 21, 2020 at 16:25 | comment | added | Manfred Weis | In the cited paper I read that it is concerned with packing a graph with "a maximal set of disjoint cycles". My question doesn't ask for finding a set of maximal cardinality, but for a set whose elements have the highest weightsum; that difference may imply a different algorithmic complexity, depending on the weights. | |
| Mar 21, 2020 at 13:00 | history | answered | Tony Huynh | CC BY-SA 4.0 |