Graph Isomorphism is PSPACE-complete
Matthew Delacorte
TL;DR
This paper establishes that the graph isomorphism problem is PSPACE-complete by synthesizing prior results on automorphism and regular expression equivalence complexities.
Contribution
It proves the PSPACE-completeness of graph isomorphism, linking it to known complex problems in automata and regular expressions.
Findings
Graph isomorphism is PSPACE-complete.
Connects automorphism problems with graph isomorphism complexity.
Highlights the computational difficulty of graph isomorphism.
Abstract
Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems" shows that graph isomorphism is PSPACE-complete.
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 · Constraint Satisfaction and Optimization · Graph Theory and Algorithms