Nam Le

Graph Coloring

Nam Le
Table of Contents

Graph Coloring #

Graph Coloring is the problem of assigning colors to vertices such that no two adjacent vertices have the same color, with applications in scheduling and frequency assignment.

Recent Literature #

  1. Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation. Arxiv, 2019. paper

    Das, Dibyendu and Ahmad, Shahid Asghar and Venkataramanan, Kumar.

  2. Neural Models for Output-Space Invariance in Combinatorial Problems ICLR, 2022. paper

    Nandwani, Yatin and Jain, Vidit and Singla, Parag and others

  3. Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring AAAI, 2022. paper, code

    Shen, Yunzhuang, Yuan Sun, Xiaodong Li, Andrew Craig Eberhard and Andreas T. Ernst.

  4. Learning to Generate Columns with Application to Vertex Coloring ICLR, 2023. paper, code

    Sun, Yuan and Ernst, Andreas T and Li, Xiaodong and Weiner, Jake

Tags:
Categories: