Corpus ID: 211082933

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}
}
  • Duc Hung Pham, Krishna V. Palem, M. V. Panduranga Rao
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • 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

    Graph isomorphisms in quasipolynomial time, 2017

    • Harald Andrés Helfgott, Jitendra Bajpai, Daniele Dona
    • 2017

    McKay and Adolfo Piperno . Practical graph isomorphism , ii

    • Y.-H Kim M.-Y Son, B.-W Oh
    • Journal of Symbolic Computation
    • 2014

    Practical graph isomorphism, II

    Faster symmetry discovery using sparsity of symmetries

    Groups - Canberra 1989: Australian National University Group Theory. Lecture Notes in Mathematics

    • L. G. Kovacs
    • 2006

    Canonical labeling of graphs