Pages that link to "Item:Q4978023"
From MaRDI portal
The following pages link to On the complexity of local distributed graph problems (Q4978023):
Displaying 14 items.
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications (Q6202221) (← links)
- Distributed Symmetry Breaking on Power Graphs via Sparsification (Q6202239) (← links)
- Faster deterministic distributed MIS and approximate matching (Q6499340) (← links)