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

Related Items (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)