A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs

Christoph Brause. A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs. Discrete Applied Mathematics, 231:113-118, 2017. [doi]

Abstract

Abstract is missing.