Distributed Degree Splitting, Edge Coloring, and Orientations
From MaRDI portal
Publication:4575915
DOI10.1137/1.9781611974782.166zbMath1410.68297arXiv1608.03220OpenAlexW2949268223MaRDI QIDQ4575915
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03220
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Vertex degrees (05C07) Distributed algorithms (68W15)
Related Items (16)
Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ What can be sampled locally? ⋮ Improved deterministic distributed matching via rounding ⋮ Improved distributed degree splitting and edge coloring ⋮ Node and edge averaged complexities of local graph problems ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Component stability in low-space massively parallel computation ⋮ Distributed graph problems through an automata-theoretic lens ⋮ Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs ⋮ An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model ⋮ Improved distributed \(\Delta\)-coloring ⋮ Almost global problems in the LOCAL model ⋮ A Time Hierarchy Theorem for the LOCAL Model ⋮ Almost global problems in the LOCAL model ⋮ Linial for lists ⋮ Distributed graph problems through an automata-theoretic Lens
This page was built for publication: Distributed Degree Splitting, Edge Coloring, and Orientations
