Pages that link to "Item:Q5176204"
From MaRDI portal
The following pages link to A new technique for distributed symmetry breaking (Q5176204):
Displayed 21 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Bounds on contention management algorithms (Q553351) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Distributed coloring of hypergraphs (Q6188146) (← links)