Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
From MaRDI portal
(Redirected from Publication:1339397)
Recommendations
- scientific article; zbMATH DE number 3893237
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- scientific article; zbMATH DE number 3882470
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Algorithms on clique separable graphs
- Anti-blocking polyhedra
- Decomposition by clique separators
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3618209 (Why is no real title available?)
- scientific article; zbMATH DE number 3893228 (Why is no real title available?)
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- On Comparability and Permutation Graphs
- On rigid circuit graphs
- On the complexity of recognizing perfectly orderable graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The complexity of satisfiability problems
- Topics on perfect graphs
Cited in
(34)- A parallel algorithm for minimum weighted colouring of triangulated graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- Graphs vertex-partitionable into strong cliques
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- On the \(P_4\)-components of graphs
- Oriented coloring on recursively defined digraphs
- On strictly chordality-\(k\) graphs
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Detecting strong cliques
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Strong cliques and equistability of EPT graphs
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- On -sparse graphs and other families
- On equistable, split, CIS, and related classes of graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
- scientific article; zbMATH DE number 3893237 (Why is no real title available?)
- Transitive orientations in bull-reducible Berge graphs
- Strong cliques in diamond-free graphs
- Minimum weighted clique cover on claw‐free perfect graphs
- Strong cliques in vertex‐transitive graphs
- Compact distributed certification of geometric graph classes
- An analogue of quasi-transitivity for edge-coloured graphs
- On P₅-free locally split graphs
- Maximum weight independent sets in hole- and dart-free graphs
- Concurrency constrained scheduling with tree-like constraints
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
This page was built for publication: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339397)
