Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$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: 2018

DOI identifier: 10.1007/s00453-018-0479-5

ISSN: 0178-4617