Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Jana Novotná 0001, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica, 83(8):2634-2650, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.