Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.

Jacobo Torán Florian Wörz

Published in: SAT (2023)

Keyphrases

cutting plane
graph isomorphism
conp complete
integer programming
graph mining
integer program
column generation
genetic algorithm
knapsack problem
lower bound
mixed integer
worst case
high dimensional
computational complexity
graph databases
decision problems
graph search