The power of multi-step Vizing chains
From MaRDI portal
Publication:6499279
DOI10.1145/3564246.3585105MaRDI QIDQ6499279
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- A simple algorithm for edge-coloring bipartite multigraphs
- List edge and list total colourings of multigraphs
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- Measurable versions of Vizing's theorem
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Efficient parallel algorithms for edge coloring problems
- Parallel Symmetry-Breaking in Sparse Graphs
- The NP-Completeness of Edge-Coloring
- Locality in Distributed Graph Algorithms
- Coloring triangle‐free graphs with local list sizes
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Towards the locality of Vizing’s theorem
- Deterministic distributed edge-coloring with fewer colors
- Dynamic Edge Coloring with Improved Approximation
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
- Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
This page was built for publication: The power of multi-step Vizing chains
