mlsanityData to 14 Oct 2026

Graph colouring algorithms

arXiv 1505.05825 ↗First posted 21 May 2015cs.DScited by 2

Not on the map. Why?

Abstract (arXiv)

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 May 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.

2 papers.

  1. 2021Federated Learning over Wireless Device-to-Device Networks: Algorithms and Convergence Analysiscited by 51
  2. 2024GFlowNets for Hamiltonian decomposition in groups of compatible operatorscited by 2