Graph colouring algorithms
From MaRDI portal
The focus of this work is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computations. The presentation aims to demonstrate the breadth of available techniques and is organized by the algorithmic paradigm.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].
Recommendations
Cited in
(18)- Worst case analysis of a graph coloring algorithm
- Solving graph coloring problems with the Douglas-Rachford algorithm
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Batch Coloring of Graphs
- scientific article; zbMATH DE number 5972368 (Why is no real title available?)
- Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
- scientific article; zbMATH DE number 4144006 (Why is no real title available?)
- CsegGraph: a graph colouring instance generator
- scientific article; zbMATH DE number 3906523 (Why is no real title available?)
- scientific article; zbMATH DE number 1998817 (Why is no real title available?)
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- scientific article; zbMATH DE number 861397 (Why is no real title available?)
- Algorithms for coloring quadtrees
- Sparse Recovery of Elliptic Solvers from Matrix-Vector Products
- Breaking the 2ⁿ barrier for 5-coloring and 6-coloring
- Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006)
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
- Complexity analysis of a decentralised graph colouring algorithm
This page was built for publication: Graph colouring algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822600)
