Pages that link to "Item:Q5172704"
From MaRDI portal
The following pages link to Distributed (δ+1)-coloring in linear (in δ) time (Q5172704):
Displayed 16 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← 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)
- Distributed \((\varDelta + 1)\)-coloring in the physical model (Q742411) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Community detection with the label propagation algorithm: a survey (Q2163684) (← 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)
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← 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)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)