AI Chat AI Image Generator AI Video Text to Speech

Lower Bound for (Sum) Coloring Problem

09/19/2019

∙

by Alexandre Gondran, et al.

∙

∙

The Minimum Sum Coloring Problem is a variant of the Graph Vertex Coloring Problem, for which each color has a weight. This paper presents a new way to find a lower bound of this problem, based on a relaxation into an integer partition problem with additional constraints. We improve the lower bound for 18 graphs of standard benchmark DIMACS, and prove the optimal value for 4 graphs by reaching their known upper bound.

Alexandre Gondran
3 publications
Vincent Duchamp
1 publication
Laurent Moalic
4 publications

page 1

page 2

page 3

page 4

research

∙ 06/07/2021

Improving Lower Bounds for Equitable Chromatic Number

In many practical applications the underlying graph must be as equitable...

0 Emanuel Florentin Olariu, et al. ∙

research

∙ 05/16/2021

A Stress-Free Sum-of-Squares Lower Bound for Coloring

We prove that with high probability over the choice of a random graph G ...

0 Pravesh K. Kothari, et al. ∙

research

∙ 08/02/2019

b-continuity and Partial Grundy Coloring of graphs with large girth

A b-coloring of a graph is a proper coloring such that each color class ...

0 Allen Ibiapina, et al. ∙

research

∙ 03/18/2020

Colorings of complements of line graphs

Our purpose is to show that complements of line graphs enjoy nice colori...

0 Hamid Reza Daneshpajouh, et al. ∙

research

∙ 08/23/2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements

The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple combinat...

0 Martin Grohe, et al. ∙

research

∙ 02/04/2019

Stabilization Time in Weighted Minority Processes

A minority process in a weighted graph is a dynamically changing colorin...

0 Pál András Papp, et al. ∙

research

∙ 08/14/2019

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

The Weisfeiler-Leman procedure is a widely-used approach for graph isomo...

0 Sandra Kiefer, et al. ∙