Holm, an assistant professor of computer science at the University ... a “good” embedding would be simple, unconvoluted. The standard example is the so-called Ladder Graph.

Theoretical computer ... problem called graph isomorphism. The result could provide a deeper understanding of the nature of computing and “might be the theoretical computer science result ...