Improved dynamic colouring of sparse graphs
From MaRDI portal
Publication:6499298
Cites work
- scientific article; zbMATH DE number 2185626 (Why is no real title available?)
- scientific article; zbMATH DE number 3769624 (Why is no real title available?)
- scientific article; zbMATH DE number 1775391 (Why is no real title available?)
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- scientific article; zbMATH DE number 910863 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 7759285 (Why is no real title available?)
- A constructive arboricity approximation scheme
- A simple greedy algorithm for dynamic graph orientation
- Adjacency queries in dynamic sparse graphs
- Alpha-algorithms for incremental planarity testing (extended abstract)
- An optimal distributed \((\Delta+1)\)-coloring algorithm?
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
- Constant-time dynamic \((\Delta+1)\)-coloring
- Constant-time dynamic weight approximation for minimum spanning forest
- Deterministic \((\Delta+1)\)-coloring in sublinear (in \(\Delta\)) time in static, dynamic, and faulty networks
- Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Dynamic bridge-finding in \(\tilde{O}(\log^2 n)\) amortized time
- Dynamic graph coloring
- Efficient randomized distributed coloring in CONGEST
- 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
- Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
- Fully-dynamic planarity testing in polylogarithmic time
- Improved dynamic graph coloring
- Incremental Edge Orientation in Forests
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linial for lists
- Locality based graph coloring
- Locality in Distributed Graph Algorithms
- Locally-iterative Distributed (Δ + 1)-coloring and Applications
- Near-optimal fully dynamic densest subgraph
- Near-optimal fully-dynamic graph connectivity
- On some packing problem related to dynamic storage allocation
- Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
- Orienting fully dynamic graphs with worst-case time bounds
- Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
- Simple and near-optimal distributed coloring for sparse graphs
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The locality of distributed symmetry breaking
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
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)
