Experimental analysis of algorithms for the dynamic graph coloring problem

DOI10.7155/JGAA.V28I1.2956zbMATH Open1548.05138MaRDI QIDQ6616236

Menno Theunis, Marcel Roeloffzen

Publication date: 8 October 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

graph coloringexperimental analysisalgorithm comparisondynamic graph coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some simplified NP-complete graph problems
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• Improved Dynamic Graph Coloring
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Dynamic graph coloring

This page was built for publication: Experimental analysis of algorithms for the dynamic graph coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616236)