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

researchr

You are not signed in
Sign in
Sign up

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica, 81(2):421-438, 2019. [doi]

This author has not been identified. Look up 'Gábor Bacsó' in GoogleThis author has not been identified. Look up 'Daniel Lokshtanov' in GoogleThis author has not been identified. Look up 'Dániel Marx' in GoogleThis author has not been identified. Look up 'Marcin Pilipczuk' in GoogleThis author has not been identified. Look up 'Zsolt Tuza' in GoogleThis author has not been identified. Look up 'Erik Jan van Leeuwen' in Google

runs on WebDSL