Le probleme de l'isomorphisme de graphes est dans P
Omar Kettani
TL;DR
This paper discusses the computational complexity of the graph isomorphism problem, suggesting it is in the class P, but the author has withdrawn it due to potential counter-examples.
Contribution
Proposed that the graph isomorphism problem might be solvable in polynomial time, challenging previous complexity classifications.
Findings
Potential polynomial-time solution for graph isomorphism
Identification of possible counter-examples to the claim
Withdrawal of the paper due to unresolved issues
Abstract
This paper has been withdrawn by the author, due to possible counter-examples.
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
TopicsAdvanced Graph Theory Research · Finite Group Theory Research · Graph theory and applications