Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for -coloring
From MaRDI portal
(Redirected from Publication:6566595)
Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
Cites work
- \((\Delta+1)\) coloring in the congested clique model
- A bound on the strong chromatic index of a graph
- A different short proof of Brooks' theorem
- A fast parallel algorithm to color a graph with Δ colors
- A lower bound for the distributed Lovász local lemma
- A strengthening of Brooks' theorem
- An NC algorithm for Brooks' theorem
- An optimal distributed (+1)-coloring algorithm?
- Approximating the AND-OR tree
- Brook's theorem
- Brooks Coloring in Parallel
- Brooks' Theorem and Beyond
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring
- Colorings and orientations of graphs
- Colouring graphs when the number of colours is almost the maximum degree
- Communication steps for parallel query processing
- Complexity measures and decision tree complexity: a survey.
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration of Measure for the Analysis of Randomized Algorithms
- Deterministic graph coloring in the streaming model
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed ∆-coloring plays hide-and-seek
- Efficient randomized distributed coloring in CONGEST
- Fast distributed Brooks' theorem
- Graph colouring and the probabilistic method
- Graph Distances in the Data-Stream Model
- Graphs with chromatic number close to maximum degree
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 7359884 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 7758308 (Why is no real title available?)
- Improved Deterministic (Δ+1) Coloring in Low-Space MPC
- Improved distributed delta-coloring
- Independent sets in vertex-arrival streams
- Near-optimal distributed degree+1 coloring
- New proof of brooks' theorem
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- On graph problems in a semi-streaming model
- Simple, Deterministic, Constant-Round Coloring in the Congested Clique
- Smaller Cuts, Higher Lower Bounds
- Streaming algorithms for 2-coloring uniform hypergraphs
- Streaming algorithms for independent sets in sparse hypergraphs
- Streaming and communication complexity of clique approximation
- Streaming and massively parallel algorithms for edge coloring
- Sublinear algorithms for ( + 1) vertex coloring
- Sublinear time and space algorithms for correlation clustering via sparse-dense decompositions
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- Three short proofs in graph theory
- Two applications of information complexity
- Δ-List Vertex Coloring in Linear Time
Cited in
(2)
This page was built for publication: Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566595)
