Timeline for Complexity of digraph homomorphism to an oriented cycle
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2022 at 11:04 | vote | accept | Florent Foucaud | ||
| Jul 15, 2022 at 11:03 | history | edited | Florent Foucaud | CC BY-SA 4.0 |
typos
|
| Jul 15, 2022 at 9:20 | comment | added | Florian | There is one other cycle: just reverse all edges. These 2 cycles are the only hard ones with 26 vertices. | |
| Jul 15, 2022 at 8:28 | comment | added | Florent Foucaud | Is this the only example on 26 vertices that your programme has found? | |
| Jul 15, 2022 at 8:27 | comment | added | Florent Foucaud | Great! This cycle has 2 top-bottom runs. Thus it is in the "difficult zone": one needs to understand Feder's paper and analyze the SAT-problem that is equivalent to this cycle problem. | |
| Jul 15, 2022 at 7:48 | history | edited | Florian | CC BY-SA 4.0 |
added 71 characters in body
|
| Jul 15, 2022 at 7:32 | review | Late answers | |||
| Jul 18, 2022 at 13:01 | |||||
| Jul 15, 2022 at 7:31 | history | edited | Florian | CC BY-SA 4.0 |
edited body
|
| S Jul 15, 2022 at 7:13 | review | First answers | |||
| Jul 19, 2022 at 6:47 | |||||
| S Jul 15, 2022 at 7:13 | history | answered | Florian | CC BY-SA 4.0 |