Weighted coloring in trees

DOI10.4230/LIPICS.STACS.2014.75MaRDI QIDQ2965473zbMATH OpenOpenAlexFDO

Authors Júlio Araújo, Nicolas Nisse, Stéphane Pérennes

Publication date 3 March 2017

Full work available at URL https://doi.org/10.4230/lipics.stacs.2014.75

zbMATH Keywords

3-SATexponential time hypothesisMax Coloringweighted coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Weighted coloring in trees
• Dual parameterization of weighted coloring
• A coloring problem for weighted graphs

Cited in

(8)

• Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
• Weighted proper orientations of trees and graphs of bounded treewidth
• Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
• A coloring problem for weighted graphs
• Weighted Improper Colouring
• Dual parameterization of weighted coloring
• Weighted coloring in trees
• Dual parameterization of weighted coloring

This page was built for publication: Weighted coloring in trees

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