scientific article; zbMATH DE number 6850309
From MaRDI portal
Publication:4607872
zbMath1402.68139arXiv1711.04355MaRDI QIDQ4607872
Danupon Nanongkai, Deeparnab Chakrabarty, Sayan Bhattacharya, Monika R. Henzinger
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1711.04355
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Vertex coloring of a graph for memory constrained scenarios ⋮ Unnamed Item ⋮ Dynamic data structures for interval coloring ⋮ Trade-offs in dynamic coloring for bipartite and general graphs ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem ⋮ Unnamed Item ⋮ Improved Dynamic Graph Coloring
This page was built for publication:
