Timeline for Complete graph invariants?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2023 at 9:11 | comment | added | The Amplitwist |
The link to springerlink.com is also broken. I'm also unable to find any snapshot saved on the Wayback Machine. Presumably, it is meant to point to the following paper: Cai, Jin-Yi; Fürer, Martin; Immerman, Neil, An optimal lower bound on the number of variables for graph identification, Combinatorica 12, No. 4, 389–410 (1992). Zbl 0785.68043.
|
|
| May 2, 2023 at 9:09 | comment | added | The Amplitwist |
The link to cs.trincoll.edu appears to be broken, but a copy is saved on the Wayback Machine. The full citation is: Miyazaki, Takunari, The complexity of McKay’s canonical labeling algorithm, Finkelstein, Larry (ed.) et al., Groups and computation II. Workshop on groups and computation, June 7–10, 1995, New Brunswick, NJ, USA. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 28, 239–256 (1997). Zbl 0878.05063.
|
|
| Jan 14, 2010 at 17:37 | vote | accept | Harrison Brown | ||
| Jan 14, 2010 at 2:07 | history | answered | Greg Kuperberg | CC BY-SA 2.5 |