← All problems
Graph Isomorphism in polynomial time
Given two finite graphs and , can one decide in time polynomial in their input size whether there exists a bijection between their vertices that preserves adjacency?
OpenTCSOpenTCSGiven two finite graphs and , can one decide in time polynomial in their input size whether there exists a bijection between their vertices that preserves adjacency?