Extension complexity of stable set polytopes of bipartite graphs.

Manuel Aprile Yuri Faenza Samuel Fiorini Tony Huynh Marco Macchia

Published in: CoRR (2017)

Keyphrases

maximum matching
stable set
bipartite graph
computational complexity
link prediction
information retrieval
genetic algorithm
constraint satisfaction problems