scientific article; zbMATH DE number 6850309

MaRDI QIDQ4607872zbMATH OpenFDO

Authors Sayan Bhattacharya, Deeparnab Chakrabarty, Danupon Nanongkai, Monika R. Henzinger

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1711.04355, http://dl.acm.org/citation.cfm?id=3175267

Mathematics Subject Classification ID

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

Recommendations

• Dynamic coloring of graphs
• Dynamic graph coloring
• Dynamic graph coloring
• On the dynamic coloring of graphs
• Fully dynamic algorithms for permutation graph coloring
• Improved dynamic graph coloring
• Improved dynamic graph coloring
• Dynamic proper colorings of a graph
• Graph colouring algorithms
• Adynamic coloring of graphs

Cited in

(36)

• Solving graph coloring problems with the Douglas-Rachford algorithm
• Vertex coloring of a graph for memory constrained scenarios
• Dynamic data structures for interval coloring
• Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
• Data structures for incremental interval coloring
• Trade-offs in dynamic coloring for bipartite and general graphs
• Dynamic coloring of graphs
• ACODYGRA: An agent algorithm for coloring dynamic graphs
• Improved dynamic graph coloring
• Improved dynamic graph coloring
• Dominating sets and connected dominating sets in dynamic graphs
• Constant-time dynamic (+1)-coloring
• scientific article; zbMATH DE number 7651158 (Why is no real title available?)
• Dynamic graph coloring
• Dynamic graph coloring
• Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
• Constant-time Dynamic (Δ +1)-Coloring
• Deterministic graph coloring in the streaming model
• On the dynamic coloring of graphs
• Improved dynamic colouring of sparse graphs
• Experimental analysis of algorithms for the dynamic graph coloring problem
• Fast deterministic algorithms for highly-dynamic networks
• Fully dynamic sequential and distributed algorithms for MAX-CUT
• Graph coloring via degeneracy in streaming and other space-conscious models
• On solution discovery via reconfiguration
• Caching connections in matchings
• Sparsity-parameterised dynamic edge colouring
• Arboricity-dependent algorithms for edge coloring
• (+1) vertex coloring in O(n) communication
• A tight lower bound for 3-coloring grids in the online-LOCAL model
• ( + 1) vertex coloring in O(n) communication
• A linear-time algorithm for (1+)-edge-coloring
• Vizing's theorem in near-linear time
• Improved streaming edge coloring
• Faster dynamic (+1)-coloring against adaptive adversaries
• Precoloring extension with demands on paths

This page was built for publication:

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