A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Let G be a locally finite infinite graph and let I(G) be the set of ends of G. The Freudenthal compactification of G is the topological space |G| which is obtained from the usual topological space of ...