The power of multi-step Vizing chains
From MaRDI portal
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- A simple algorithm for edge-coloring bipartite multigraphs
- Asymptotically good list-colorings
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- Coloring triangle-free graphs with local list sizes
- Deterministic distributed \((\Delta + o(\Delta))\)-edge-coloring, and vertex-coloring of graphs with bounded diversity
- Deterministic distributed edge-coloring with fewer colors
- Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
- Dynamic Edge Coloring with Improved Approximation
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Efficient parallel algorithms for edge coloring problems
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 6850477 (Why is no real title available?)
- List edge and list total colourings of multigraphs
- Locality in Distributed Graph Algorithms
- Measurable versions of Vizing's theorem
- Parallel Symmetry-Breaking in Sparse Graphs
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- The list chromatic index of a bipartite multigraph
- The NP-Completeness of Edge-Coloring
- Towards the locality of Vizing's theorem
Cited in
(16)- Borel Vizing's theorem for graphs of subexponential growth
- Local version of Vizing's theorem for multigraphs
- Caching connections in matchings
- Sparsity-parameterised dynamic edge colouring
- Arboricity-dependent algorithms for edge coloring
- The distributed complexity of locally checkable labeling problems beyond paths and trees
- Fast algorithms for Vizing's theorem on bounded degree graphs
- Fast and simple (1 + ) -edge-coloring of dense graphs
- Multigraph edge-coloring with local list sizes
- Measurable Vizing's theorem
- Density-sensitive algorithms for (+1)-edge coloring
- Edge-coloring sparse graphs with Colors in quasilinear time
- A linear-time algorithm for (1+)-edge-coloring
- Distributed edge coloring in time polylogarithmic in \({\Delta }\)
- Vizing's theorem in near-linear time
- Improved streaming edge coloring
This page was built for publication: The power of multi-step Vizing chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499279)
