Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.

Jacobo Torán Florian Wörz

Published in: Electron. Colloquium Comput. Complex. (2023)

Keyphrases

cutting plane
graph isomorphism
worst case
integer programming
knapsack problem
column generation
lower bound
conp complete
computational complexity
graph mining
integer program
graph search
upper bound
probabilistic model
decision problems
special case
search algorithm
mixed integer