Bacsó, G., Lokshtanov, D., Marx, D., Pilipczuk, M., Tuza, Z., & van Leeuwen, E. J. (2019). Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica, 81(2), 421-438. https://doi.org/10.1007/s00453-018-0479-5
Chicago-Zitierstil (17. Ausg.)Bacsó, Gábor, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, und Erik Jan van Leeuwen. "Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P T -Free and Broom-Free Graphs." Algorithmica 81, no. 2 (2019): 421-438. https://doi.org/10.1007/s00453-018-0479-5.
MLA-Zitierstil (9. Ausg.)Bacsó, Gábor, et al. "Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P T -Free and Broom-Free Graphs." Algorithmica, vol. 81, no. 2, 2019, pp. 421-438, https://doi.org/10.1007/s00453-018-0479-5.