1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2018
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…
cs.CC2018
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,…
cs.CC2007★ 1 cited
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…