Improved dynamic graph coloring

DOI10.1145/3392724zbMATH Open1484.68172OpenAlexW3033362299MaRDI QIDQ4987463FDOQ4987463

Authors: Shay Solomon, Nicole Wein 

Publication date: 3 May 2021

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9535/

Recommendations

• Improved dynamic graph coloring
• Dynamic graph coloring
• Dynamic graph coloring
• scientific article; zbMATH DE number 6850309
• Dynamic Edge Coloring with Improved Approximation

zbMATH Keywords

graph coloringdynamic graph algorithmsedge orientationsgraph arboricity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Dynamic coloring of graphs
• Title not available (Why is that?)
• A new color change to improve the coloring of a graph
• Experimental analysis of algorithms for the dynamic graph coloring problem
• Dynamic graph coloring
• Improved dynamic colouring of sparse graphs
• Improved dynamic graph coloring
• Competitive vertex recoloring. (Online disengagement)
• Trade-offs in dynamic coloring for bipartite and general graphs
• Dynamic Edge Coloring with Improved Approximation

This page was built for publication: Improved dynamic graph coloring

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