Minimum weighted clique cover on claw‐free perfect graphs
From MaRDI portal
Publication:6055392
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Perfect graphs (05C17)
Recommendations
- Minimum weighted clique cover on strip-composed perfect graphs
- scientific article; zbMATH DE number 3893237
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- scientific article; zbMATH DE number 3102314 (Why is no real title available?)
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A characterization of perfect graphs
- A description of claw-free perfect graphs
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- Claw-free graphs. VII. Quasi-line graphs
- Combinatorial optimization with 2-joins
- Decomposition by clique separators
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Geometric algorithms and combinatorial optimization
- Line perfect graphs
- Linear time algorithms on circular-arc graphs
- Minimum weighted clique cover on strip-composed perfect graphs
- On linear and circular structure of (claw, net)-free graphs
- On maximal independent sets of vertices in claw-free graphs
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Optimizing weakly triangulated graphs
- Polyhedral proof methods in combinatorial optimization
- Recognizing claw-free perfect graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Some simplified NP-complete graph problems
- The complexity of comparability graph recognition and coloring
- The ellipsoid method and its consequences in combinatorial optimization
- The stable set polytope of quasi-line graphs
- The strong perfect graph theorem
- The structure of claw-free graphs
- The structure of claw-free perfect graphs
Cited in
(7)- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Clique covers in claw-free Berge graphs
- Minimum weighted clique cover on strip-composed perfect graphs
- scientific article; zbMATH DE number 3893237 (Why is no real title available?)
- Weighted well-covered claw-free graphs
- Assignment-minimum clique coverings
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
This page was built for publication: Minimum weighted clique cover on claw‐free perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6055392)
