Improved dynamic colouring of sparse graphs

Cites Work

Title not available (Why is that?)
Forests, frames, and games: Algorithms for matroid sums and applications
Linear degree extractors and the inapproximability of max clique and chromatic number
On some packing problem related to dynamic storage allocation
Title not available (Why is that?)
Locality in Distributed Graph Algorithms
Locality based graph coloring
Adjacency queries in dynamic sparse graphs
Distributed (∆+1)-coloring in sublogarithmic rounds
Families of finite sets in which no set is covered by the union of $r$ others
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Near-optimal fully-dynamic graph connectivity
Title not available (Why is that?)
The Locality of Distributed Symmetry Breaking
A Constructive Arboricity Approximation Scheme
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
Title not available (Why is that?)
Title not available (Why is that?)
Dynamic graph coloring
Alpha-algorithms for incremental planarity testing (extended abstract)
Title not available (Why is that?)
Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
Simple and near-optimal distributed coloring for sparse graphs
Locally-iterative Distributed (Δ + 1)-coloring and Applications
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
An optimal distributed (Δ+1)-coloring algorithm?
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
Constant-time dynamic weight approximation for minimum spanning forest
Fully-dynamic planarity testing in polylogarithmic time
Title not available (Why is that?)
Linial for lists
Efficient randomized distributed coloring in CONGEST
Near-optimal fully dynamic densest subgraph
Incremental Edge Orientation in Forests
Title not available (Why is that?)
Improved Dynamic Graph Coloring
Title not available (Why is that?)
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Title not available (Why is that?)
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time

This page was built for publication: Improved dynamic colouring of sparse graphs

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