Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
From MaRDI portal
Publication:5146928
Cited in
(16)- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Finding Large H-Colorable Subgraphs in Hereditary Graph Classes
- scientific article; zbMATH DE number 6297706 (Why is no real title available?)
- On the maximum weight independent set problem in graphs without induced cycles of length at least five
- scientific article; zbMATH DE number 7651162 (Why is no real title available?)
- scientific article; zbMATH DE number 7651174 (Why is no real title available?)
- Parameterized inapproximability of independent set in \(H\)-free graphs
- Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
- Treewidth versus clique number. II: Tree-independence number
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
- Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
- Max weight independent set in sparse graphs with no long claws
- Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument
- Complexity of the list homomorphism problem in hereditary graph classes
- Star-based separators for intersection graphs of c-colored pseudo-segments
This page was built for publication: Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146928)
