Timeline for Breaking frustrated loops in list coloring problem
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 11, 2011 at 3:22 | history | edited | Tony Huynh | CC BY-SA 2.5 |
added 133 characters in body
|
| Jan 10, 2011 at 19:09 | comment | added | Yaroslav Bulatov | I realize that breaking all frustrated cycles is probably too hard, so I need to find k nodes that break as many cycles as possible | |
| Jan 10, 2011 at 16:31 | history | answered | Tony Huynh | CC BY-SA 2.5 |