Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
From MaRDI portal
(Redirected from Publication:412344)
Recommendations
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3168327 (Why is no real title available?)
- scientific article; zbMATH DE number 3893228 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Algorithmic graph theory and perfect graphs
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Characterising \((k,\ell )\)-leaf powers
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- Decomposition by clique separators
- Doubly Lexical Orderings of Matrices
- Doubly lexical ordering of dense 0--1 matrices
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Even-hole-free graphs: A survey
- Finding a maximum induced matching in weakly chordal graphs
- Graph Classes: A Survey
- Linear time solvable optimization problems on graphs of bounded clique-width
- New applications of clique separator decomposition for the maximum weight stable set problem
- On algorithms for (P₅, gem)-free graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On distance-3 matchings and induced matchings
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On graphs without a \(C_{4}\) or a diamond
- On rigid circuit graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Simplicial powers of graphs
- The strong perfect graph theorem
- Three Partition Refinement Algorithms
- Topics in Intersection Graph Theory
Cited in
(17)- Approximation of knapsack problems with conflict and forcing graphs
- Organizing the atoms of the clique separator decomposition into an atom tree
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Strong cliques in diamond-free graphs
- scientific article; zbMATH DE number 6432456 (Why is no real title available?)
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Complexity and polynomially solvable special cases of QUBO
- Disjoint clique cutsets in graphs without long holes
- Maximum weight independent sets in hole- and dart-free graphs
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- One-three join: a graph operation and its consequences
- Colouring diamond-free graphs
- Weighted independent sets in a subclass of P₆-free graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Induced subgraphs of bounded treewidth and the container method
This page was built for publication: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412344)
