Madathil, J., Sharma, R., & Zehavi, M. (2021). A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica, 83(6), 1861-1884. https://doi.org/10.1007/s00453-021-00806-x
Chicago-Zitierstil (17. Ausg.)Madathil, Jayakrishnan, Roohani Sharma, und Meirav Zehavi. "A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs." Algorithmica 83, no. 6 (2021): 1861-1884. https://doi.org/10.1007/s00453-021-00806-x.
MLA-Zitierstil (9. Ausg.)Madathil, Jayakrishnan, et al. "A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs." Algorithmica, vol. 83, no. 6, 2021, pp. 1861-1884, https://doi.org/10.1007/s00453-021-00806-x.