Preprint 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 (doi: 10.20944/preprints202108.0467.v1). Haque, S.A. A Polynomial Time Algorithm for Graph Isomorphism and Automorphism. Preprints 2021, 2021080467 (doi: 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

MATHEMATICS & COMPUTER SCIENCE, General & Theoretical Computer Science

Comments (1)

Comment 1
Received: 6 November 2021
Commenter: Jovan Radenković
The commenter has declared there is no conflict of interests.
Comment: What is the complexity of the PDF algorithm for graph isomorphism and automorphism?
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.