The complexity of independent set reconfiguration on bipartite graphs

Daniel Lokshtanov, Amer E. Mouawad. The complexity of independent set reconfiguration on bipartite graphs. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 185-195, SIAM, 2018. [doi]

Abstract

Abstract is missing.