Degree-Based Logical Adjacency Checking (DBLAC): A Novel Heuristic for Vertex Coloring
This work addresses graph coloring, a fundamental NP-hard problem in computer science, with incremental improvements for applications like scheduling and register allocation.
The paper tackles the graph vertex coloring problem by introducing DBLAC, a heuristic that uses logical AND operations to assign colors, resulting in competitive performance in terms of colors used and runtime compared to DSATUR and RLF algorithms.
Degree Based Logical Adjacency Checking (DBLAC). An efficient coloring of graphs with unique logical AND operations. The logical AND operation shows more effective color assignment and fewer number of induced colors in the case of common edges between vertices. In this work, we provide a detailed theoretical analysis of DBLAC's time and space complexity. It furthermore shows its effectiveness through prolonged experiments on standard benchmark graphs. We compare it with existing algorithms, namely DSATUR and Recursive Largest First (RLF). Second, we show how DBLAC achieves competitive results with respect to both the number of colors used and runtime performance.