Improved dynamic colouring of sparse graphs

Cites Work

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

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