Pages that link to "Item:Q5236231"
From MaRDI portal
The following pages link to Sublinear Algorithms for (Δ + 1) Vertex Coloring (Q5236231):
Displaying 16 items.
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Single-pass streaming algorithms to partition graphs into few forests (Q2695324) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5075750) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- (Q5091196) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- (Q6062143) (← links)
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring (Q6083481) (← links)
- (Q6084349) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)