This procedure involves simplifying a graph isomorphism problem by either identifying smaller “Johnson” graphs within the two graphs being compared, or finding a way to color the two graphs that ...

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either ...