Timeline for Are regular graphs the hardest instance for graph isomorphism?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2017 at 9:02 | vote | accept | fddwd | ||
| Sep 24, 2017 at 4:56 | comment | added | Mikhail Tikhomirov | With this phrase I meant that I would expect a random regular graph to be very susceptible to individualization/WL (I couldn't find a source to back this statement though). | |
| Sep 20, 2017 at 12:51 | comment | added | fddwd | when you say " The majority of regular graphs are easy with respect to this approach " did u mean complete graphs? | |
| Sep 16, 2017 at 20:19 | comment | added | Mikhail Tikhomirov | I've added some explanations. Please ask if you have further specific questions. | |
| Sep 16, 2017 at 20:18 | history | edited | Mikhail Tikhomirov | CC BY-SA 3.0 |
added 711 characters in body
|
| Sep 16, 2017 at 17:24 | history | edited | Mikhail Tikhomirov | CC BY-SA 3.0 |
added 232 characters in body
|
| Sep 16, 2017 at 16:59 | history | answered | Mikhail Tikhomirov | CC BY-SA 3.0 |