Pages that link to "Item:Q6487543"
From MaRDI portal
The following pages link to The complexity of symmetry breaking in massive graphs (Q6487543):
Displaying 6 items.
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- The cost of symmetry in connected graphs (Q2680748) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- Special issue of ADAM devoted to the International Workshop on Symmetries of Graph and Networks 2018 (Q5121543) (← links)
- Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets (Q6487514) (← links)