On graphs with polynomially solvable maximum-weight clique problem

Recommendations

On the Maximum Weight Clique Problem
Maximum cliques of hypergraphs and polynomial optimization
scientific article; zbMATH DE number 26478
On solving the maximum clique problem
On the maximal clique problem
scientific article; zbMATH DE number 1424314
scientific article; zbMATH DE number 956840
A new upper bound for the maximum weight clique problem
Solving maximum weight clique using maximum satisfiability reasoning

Cites work

On cliques in graphs

Cited in

(67)

The maximum clique problem
Independent domination in finitely defined classes of graphs
An inequality for polymatroid functions and its applications.
On easy and hard hereditary classes of graphs with respect to the independent set problem
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
Blocker size via matching minors
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Maximum weight independent set for claw-free graphs in polynomial time
The critical node detection problem in networks: a survey
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Stability number in subclasses of \(P_5\)-free graphs
Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
Extension of hereditary classes with substitutions
Independent sets of maximum weight in (\(p,q\))-colorable graphs.
Scheduling independent tasks with multiple modes
Algorithms for induced biclique optimization problems
Simple games versus weighted voting games: bounding the critical threshold value
The maximum independent union of cliques problem: complexity and exact approaches
On the complexity of the independent set problem in triangle graphs
The complexity of dissociation set problems in graphs
On efficient domination for some classes of H-free bipartite graphs
The k-separator problem: polyhedra, complexity and approximation results
The clique problem for graphs with a few eigenvalues of the same sign
From matchings to independent sets
More results on weighted independent domination
Complexity and algorithms for recognizing polar and monopolar graphs
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Maximum weight edge-constrained matchings
Minimum cost and list homomorphisms to semicomplete digraphs
Bounding the number of circuits of a graph
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
Unique key Horn functions
The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
Reconfiguration of cliques in a graph
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties
4-coloring \(H\)-free graphs when \(H\) is small
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Graphs of separability at most two: structural characterizations and their consequences
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
Colouring vertices of triangle-free graphs
Squares of Intersection Graphs and Induced Matchings
Graphs with maximal induced matchings of the same size
On the Maximum Weight Clique Problem
Graphs of separability at most 2
Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time
scientific article; zbMATH DE number 2044928 (Why is no real title available?)
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
On the parameterized complexity of coloring graphs in the absence of a linear forest
Clique problem, cutting plane proofs and communication complexity
Independent sets in graphs
Well-indumatched Trees and Graphs of Bounded Girth
An upper bound for the number of maximal independent sets in a graph
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
On cycle transversals and their connected variants in the absence of a small linear forest
Strong cliques in diamond-free graphs
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Star covers and star partitions of cographs and butterfly-free graphs
Computing subset vertex covers in H-free graphs
Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
Some classifications of the computational complexity for the vertex 3-colourability problem
Updating the complexity status of coloring graphs without a fixed induced linear forest
Colouring vertices of triangle-free graphs without forests
Independent domination in hereditary classes
The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable
New applications of clique separator decomposition for the maximum weight stable set problem
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
Shuffling biological sequences with motif constraints

This page was built for publication: On graphs with polynomially solvable maximum-weight clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809822)