Crossmark

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs

Crossref DOI link: https://doi.org/10.1007/s00453-018-0479-5

Published Online: 2018-07-16

Published Print: 2019-02

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Bacsó, Gábor

Lokshtanov, Daniel

Marx, Dániel

Pilipczuk, Marcin

Tuza, Zsolt

van Leeuwen, Erik Jan
Funding

Funding for this research was provided by:

FP7 Ideas: European Research Council (280152)

FP7 Ideas: European Research Council (280152)

H2020 European Research Council (714704)

H2020 European Research Council (725978)

H2020 European Research Council (725978)

H2020 European Research Council (715744)

National Research, Development and Innovation Office - NKFIH (SNN 116095)
License Information

Text and Data Mining valid from 2018-07-16
More Information

Article History

Received: 18 November 2017

Accepted: 4 July 2018

First Online: 16 July 2018