Pages that link to "Item:Q392191"
From MaRDI portal
The following pages link to Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191):
Displaying 10 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Distributed Symmetry Breaking on Power Graphs via Sparsification (Q6202239) (← links)
