TL;DR
This chapter introduces various vertex-colouring algorithms for general graphs, emphasizing their theoretical guarantees and diverse algorithmic paradigms in a comprehensive overview.
Contribution
It provides a broad survey of graph colouring algorithms organized by paradigm, highlighting their worst-case performance guarantees for general graphs.
Findings
Multiple algorithmic paradigms for vertex colouring
Performance guarantees for general graph classes
Comprehensive overview of existing techniques
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Markov Chains and Monte Carlo Methods · Complexity and Algorithms in Graphs