Pages that link to "Item:Q3460717"
From MaRDI portal
The following pages link to A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717):
Displaying 10 items.
- Computing large independent sets in a single round (Q1699422) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
