Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...