Parameterized and exact algorithms for class domination coloring
From MaRDI portal
Publication:2659082
Recommendations
- Parameterized and exact algorithms for class domination coloring
- Algorithmic aspects of dominator colorings in graphs
- Exact and parameterized algorithms for \((k,i)\)-coloring
- Exact and approximative algorithms for coloring G(n,p)
- Parameterized algorithms for conflict-free colorings of graphs
- Efficient algorithms for parameterized \(H\)-colorings
- An exact algorithm for the partition coloring problem
- Complexity of total dominator coloring in graphs
- Dominating set based exact algorithms for 3-coloring
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A branch-and-reduce algorithm for finding a minimum independent dominating set
- A lower bound of the cd-chromatic number and its complexity
- A note on the complexity of the chromatic number problem
- Algorithmic graph theory and perfect graphs
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- B-chromatic number: beyond NP-hardness
- Color class domination number of middle graph and center graph of \(K_{1,n}\), \(C_n\) and \(P_n\)
- Coloring edges and vertices of graphs without short or long cycles
- Dominated colorings of graphs
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- Exact algorithms for dominating set
- Fast multiplication of large numbers
- Faster parameterized algorithms using linear programming
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fundamentals of parameterized complexity
- Graph theory
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Improved upper bounds for vertex cover
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Minimum dominating set approximation in graphs of bounded arboricity
- On dominated coloring of graphs and some Nordhaus–Gaddum-type relations
- On the complexity of cd-coloring of graphs
- Parameterized algorithms
- Parameterized approximation of dominating set problems
- Parameterized complexity of vertex colouring
- Parametrized complexity theory.
- Set partitioning via inclusion-exclusion
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- The cd-coloring of graphs
- The complexity of generalized clique covering
- The maximum k-colorable subgraph problem for chordal graphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(7)- On the complexity of minimum \(q\)-domination partization problems
- Parameterized and exact algorithms for class domination coloring
- Total domination, separated-cluster, CD-coloring: algorithms and hardness
- Dominator coloring and CD coloring in almost cluster graphs
- The cd-coloring of graphs
- A lower bound of the cd-chromatic number and its complexity
- On CD-chromatic number and its lower bound in some classes of graphs
This page was built for publication: Parameterized and exact algorithms for class domination coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659082)
