Pages that link to "Item:Q3809822"

The following pages link to On graphs with polynomially solvable maximum-weight clique problem (Q3809822):

Displaying 50 items.

• Graphs with maximal induced matchings of the same size (Q344824) (← links)
• Graphs of separability at most 2 (Q415268) (← links)
• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
• Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
• Independent sets in graphs (Q501998) (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
• Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
• Independent domination in hereditary classes (Q818132) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
• Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
• Shuffling biological sequences with motif constraints (Q935837) (← links)
• The maximum clique problem (Q1318271) (← links)
• Independent domination in finitely defined classes of graphs (Q1399990) (← links)
• An inequality for polymatroid functions and its applications. (Q1410680) (← links)
• On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
• On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs (Q1603536) (← links)
• Blocker size via matching minors (Q1637141) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
• Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
• Extension of hereditary classes with substitutions (Q1811128) (← links)
• Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) (← links)
• Scheduling independent tasks with multiple modes (Q1900136) (← links)
• Algorithms for induced biclique optimization problems (Q1944925) (← links)
• Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
• From matchings to independent sets (Q2403787) (← links)
• More results on weighted independent domination (Q2410364) (← links)
• Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
• On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
• Maximum weight edge-constrained matchings (Q2476253) (← links)
• Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
• Bounding the number of circuits of a graph (Q2563510) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• Unique key Horn functions (Q2672584) (← links)
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
• Reconfiguration of cliques in a graph (Q2700609) (← links)
• Parameterized complexity of the maximum independent set problem and the speed of hereditary properties (Q2851451) (← links)