Apurv Tiwari

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper presents an exhaustive approach for verification of the weak reconstruction of Self Complementary Graphs upto 17 vertices. It describes the general problem of the Reconstruction Conjecture, explaining the complexity involved in checking deck-isomorphism between two graphs. In order to improve the computation time, various pruning techniques have(More)
  • 1