Timeline for Polynomial time algorithm for rigid graph isomorphism
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2021 at 6:55 | comment | added | joro | May I have your opinion about Maximum independent set in dense graphs | |
| Jul 23, 2021 at 10:24 | comment | added | joro | Rigid strongly regular graphs are indeed counterexamples to the current algorithm. Tested with a graph of order 36. | |
| Jul 23, 2021 at 1:00 | comment | added | Tony Huynh | Thanks, it is clearer now. FWIW though, I agree with Brendan McKay that $J'$ will sometimes have solutions even when the guess is wrong. | |
| Jul 21, 2021 at 8:33 | comment | added | joro | Thanks. I edited the guessing part, is it clear now? | |
| Jul 21, 2021 at 2:22 | history | answered | Tony Huynh | CC BY-SA 4.0 |