From Invariants to Canonization

Yuri Gurevich

Bulletin of the European Association for Theoretical Computer Science |

We show that every polynomial-time full-invariant algorithm for graphs gives rise to a polynomial-time canonization algorithm for graphs.

This publication was reprinted in 2001 World Scientific book, Current Trends in Theoretical Computer Science, pages 327-331.