Timeline for a colouring / matching problem
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2014 at 21:50 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
deleted 1 character in body
|
| Sep 19, 2014 at 19:01 | comment | added | Martin Rubey | Thank you! Yes, I'm not hoping for an efficient algorithm anymore, I just want to solve this one instance whose sizes I mentioned. I know already that ignoring the numbers this special instance has a solution. I'll have to think whether I can use this information (or reducing to two tags) without too much programming work, to see whether it possibly reduces running time. | |
| Sep 19, 2014 at 17:51 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |