Maja Omanovic

Learn More
The Graph Isomorphism (GI) problem consists of deciding whether there exists a bijective mapping from the vertices of one graph to the vertices of the second graph such that the edge adjacencies are respected. GI is of great interest since it is one of the few problems contained in NP that is neither known to be computable in polynomial time nor to be(More)
  • 1