Algorithms for #BIS-hard problems on expander graphs.

Matthew Jenssen Peter Keevash Will Perkins

Published in: SODA (2019)

Keyphrases

hard problems
data structure
phase transition
computational complexity
directed graph
genetic algorithm
learning algorithm
state space
test problems
hyper heuristics
subgraph isomorphism
random instances