Dynamic graph coloring
From MaRDI portal
Recommendations
Cites work
- ACODYGRA: An agent algorithm for coloring dynamic graphs
- An on-line graph coloring algorithm with sublinear performance ratio
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Dynamic coloring of graphs
- Dynamic graph coloring
- Dynamic graph connectivity in polylogarithmic worst case time
- Fully dynamic maximal matching in O( n) update time
- Fully dynamic randomized algorithms for graph spanners
- Fully-dynamic min-cut
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Lower bounds for on-line graph coloring
- Parallel and On-Line Graph Coloring
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Randomized online graph coloring
- Reducibility among combinatorial problems
- Simple heuristics for unit disk graphs
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(26)- On the dynamic coloring of graphs
- Dynamic coloring of graphs
- Sliding window temporal graph coloring
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Fully dynamic algorithms for permutation graph coloring
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- Constant-time Dynamic (Δ +1)-Coloring
- Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
- Experimental analysis of algorithms for the dynamic graph coloring problem
- Graph coloring via degeneracy in streaming and other space-conscious models
- Dynamic graph coloring
- Batch Coloring of Graphs
- Improved dynamic graph coloring
- Dynamic coloring on restricted graph classes
- Constant-time dynamic (+1)-coloring
- Caching connections in matchings
- Eternal coloring of a graph
- Distributed recoloring
- Improved dynamic colouring of sparse graphs
- Data structures for incremental interval coloring
- Improved dynamic graph coloring
- Trade-offs in dynamic coloring for bipartite and general graphs
- Competitive vertex recoloring. (Online disengagement)
- ACODYGRA: An agent algorithm for coloring dynamic graphs
- Dynamic data structures for interval coloring
- Dynamic Edge Coloring with Improved Approximation
This page was built for publication: Dynamic graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915986)
