arXiv subjects

Matthew Delacorte

Publications and source records attributed to Matthew Delacorte.

2 recordsLinked to original sources

arXiv2007

Graph Isomorphism is PSPACE-complete

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.

cs.CC↗

arXiv2006

Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs

We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.

cs.DM↗