Polynomial Time Algorithm for Graph Isomorphism Testing
Michael I. Trofimov
TL;DR
This paper presents a new polynomial time algorithm for testing graph isomorphism, potentially advancing the understanding of this computational problem.
Contribution
It introduces a novel polynomial time algorithm for graph isomorphism testing, improving upon previous methods.
Findings
Algorithm runs in polynomial time
Efficiently distinguishes non-isomorphic graphs
Advances theoretical understanding of graph isomorphism
Abstract
This article deals with new polynomial time algorithm for graph isomorphism testing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Software Testing and Debugging Techniques · Advanced Graph Neural Networks