# A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors

@article{Pham2020APT, title={A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors}, author={Duc Hung Pham and Krishna V. Palem and M. V. Panduranga Rao}, journal={ArXiv}, year={2020}, volume={abs/2002.04638} }

The Graph Isomorphism (GI) problem is a theoretically interesting problem because it has not been proven to be in P nor to be NP-complete. Babai made a breakthrough in 2015 when announcing a quasipolynomial time algorithm for GI problem. Babai's work gives the most theoretically efficient algorithm for GI, as well as a strong evidence favoring the idea that class GI $\ne$ NP and thus P $\ne$ NP. Based on Babai's algorithm, we prove that GI can further be solved by a parallel algorithm that runs… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES