Pages that link to "Item:Q2403797"
From MaRDI portal
The following pages link to A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797):
Displaying 14 items.
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)
- (Q5874504) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
