Sparsity-parameterised dynamic edge colouring
From MaRDI portal
Cites work
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- Decomposition of Finite Graphs Into Forests
- Deterministic distributed \((\Delta + o(\Delta))\)-edge-coloring, and vertex-coloring of graphs with bounded diversity
- Deterministic distributed edge-coloring with fewer colors
- Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach
- Dynamic Edge Coloring with Improved Approximation
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Fully dynamic MIS in uniformly sparse graphs
- scientific article; zbMATH DE number 2185626 (Why is no real title available?)
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- scientific article; zbMATH DE number 6850477 (Why is no real title available?)
- Improved distributed algorithms for the Lovász local lemma and edge coloring
- On the linear vertex-arboricity of a planar graph
- Online bipartite matching with amortized O(^2 n) replacements
- Orienting fully dynamic graphs with worst-case time bounds
- Smallest-last ordering and clustering and graph coloring algorithms
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
- Sublogarithmic distributed \textsc{MIS} algorithm for sparse graphs using Nash-Williams decomposition
- The complexity of path coloring and call scheduling
- The NP-Completeness of Edge-Coloring
- The power of multi-step Vizing chains
- Towards the locality of Vizing's theorem
Cited in
(3)
This page was built for publication: Sparsity-parameterised dynamic edge colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891132)
