Pages that link to "Item:Q2465646"

The following pages link to On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646):

Displaying 41 items.

• Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
• Complexity of coloring graphs without paths and cycles (Q344861) (← links)
• On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
• Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
• On distance-3 matchings and induced matchings (Q716178) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
• On the maximum independent set problem in graphs of bounded maximum degree (Q778157) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
• An introduction to clique minimal separator decomposition (Q1662549) (← links)
• Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
• An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
• Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
• Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
• Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• (Q3035321) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem (Q3596359) (← links)
• Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
• Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
• On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
• Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)