Vertex Ordering Algorithms for Graph Coloring Problem

08/26/2020
by   Arda Asik, et al.
0

Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least number of colors in such a way that a vertex has a different color than its neighbors. The problem, as well as its different variants, has been proven to be NP-Hard. Therefore, there are greedy algorithms in the literature aiming to use a small number of colors. These algorithms traverse the vertices and color them one by one. The vertex visit order has a significant impact on the number of colors used. In this work, we investigated if social network analytics metrics can be used to find this order. Our experiments showed that when closeness centrality is used to find vertex visit order, a smaller number of colors is used by the greedy algorithms.

READ FULL TEXT
research
02/19/2021

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

Given a graph G=(V,E), the b-coloring problem consists in attributing a ...
research
08/26/2020

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

We develop the first parallel graph coloring heuristics with strong theo...
research
09/19/2022

Gradual Weisfeiler-Leman: Slow and Steady Wins the Race

The classical Weisfeiler-Leman algorithm aka color refinement is fundame...
research
08/06/2019

An Index for Sequencing Reads Based on The Colored de Bruijn Graph

In this article, we show how to transform a colored de Bruijn graph (dBG...
research
06/03/2019

An Information-Theoretical Approach to the Information Capacity and Cost-Effectiveness Evaluation of Color Palettes

Colors are used as effective tools of representing and transferring info...
research
06/14/2022

The Complexity of Finding Fair Many-to-One Matchings

We analyze the (parameterized) computational complexity of "fair" varian...
research
06/28/2022

Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem

The vertex coloring problem asks for the minimum number of colors that c...

Please sign up or login with your details

Forgot password? Click here to reset