Timeline for Are regular graphs the hardest instance for graph isomorphism?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2017 at 11:43 | comment | added | David Roberson | To be fair, the 1-dimensional Weisfeiler-Leman (I heard somewhere that the correct spelling is actually without an 'h') algorithm does not distinguish regular graphs of the same order, but does distinguish asymptotically almost all graphs. So calling it "spectacularly weak" might be an overstatement. | |
| Sep 17, 2017 at 1:50 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |