1 citations · 1 across the 2 of their papers we have counts for
4 papers
Graph Isomorphism by Conversion to Chordal (6, 3) Graphs
M. Delacorte
Babel has shown that for an extended class of chordal (6, 3) graphs the coarsest regular simplicial partition is equivalent to the graph's automorphism partition. We give a reversi…
Solving 3SAT By Reduction To Testing For Odd Hole
M. Delacorte
An algorithm is given for finding the solutions to 3SAT problems. The algorithm uses Bienstock's reduction from 3SAT to existence of induced odd cycle of length greater than three,…
Graph Isomorphism is PSPACE-complete
Matthew Delacorte
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…
Polynomial Time Symmetry and Isomorphism Testing for Connected Graphs
Matthew Delacorte
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 grap…