Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen

Journal title: Algorithmica

Journal publisher: Springer Verlag

Published year: 2019

ISSN: 0178-4617