Graph colouring algorithms

zbMATH Open1351.05077arXiv1505.05825MaRDI QIDQ2822600FDOQ2822600

Authors: Thore Husfeldt 

Publication date: 30 September 2016

Full work available at URL: https://arxiv.org/abs/1505.05825

Recommendations

• Some sequential graph colouring algorithms
• scientific article; zbMATH DE number 4134072
• scientific article; zbMATH DE number 3841898
• Guide to graph colouring. Algorithms and applications
• A guide to graph colouring. Algorithms and applications

zbMATH Keywords

graph colouringvertex colouringvertex-colouring algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cited In (17)

• Complexity analysis of a decentralised graph colouring algorithm
• Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
• Title not available (Why is that?)
• Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
• Sparse Recovery of Elliptic Solvers from Matrix-Vector Products
• CsegGraph: a graph colouring instance generator
• Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006)
• Title not available (Why is that?)
• Worst case analysis of a graph coloring algorithm
• Solving graph coloring problems with the Douglas-Rachford algorithm
• Title not available (Why is that?)
• Batch Coloring of Graphs
• Title not available (Why is that?)
• Algorithms for coloring quadtrees
• Title not available (Why is that?)
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• Title not available (Why is that?)

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)