Pages that link to "Item:Q5854894"
From MaRDI portal
The following pages link to On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894):
Displaying 8 items.
- Some results on weighted graphs without induced cycles of nonpositive weights (Q354469) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
