Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Polynomial Time Algorithm for Graph Isomorphism and Automorphism
Version 1
: Received: 23 August 2021 / Approved: 24 August 2021 / Online: 24 August 2021 (13:56:35 CEST)
How to cite: Haque, S.A. A Polynomial Time Algorithm for Graph Isomorphism and Automorphism. Preprints 2021, 2021080467. https://doi.org/10.20944/preprints202108.0467.v1 Haque, S.A. A Polynomial Time Algorithm for Graph Isomorphism and Automorphism. Preprints 2021, 2021080467. https://doi.org/10.20944/preprints202108.0467.v1
Abstract
This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.
Keywords
graph isomorphism; graph automorphism; polynomial time algorithm
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (1)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
Commenter: Jovan Radenković
The commenter has declared there is no conflict of interests.