Quasi-polynomial-time algorithm for independent set in P_t-free graphs via shrinking the space of induced paths

DOI10.1137/1.9781611976496.23MaRDI QIDQ6538760zbMATH OpenFDO

Authors Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski

Publication date 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Cutting a tree with subgraph complementation is hard, except for some small trees
• Induced subgraphs of bounded treewidth and the container method

This page was built for publication: Quasi-polynomial-time algorithm for independent set in \(P_t\)-free graphs via shrinking the space of induced paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538760)