Pages that link to "Item:Q2934330"
From MaRDI portal
The following pages link to A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330):
Displaying 28 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)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Distributed backup placement (Q2084982) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Beeping a maximal independent set (Q2441534) (← links)
- On the computation of fixed points in Boolean networks (Q2511059) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- Topology Control and Routing in Ad Hoc Networks (Q3404481) (← links)
- Nearly Optimal Local Broadcasting in the SINR Model with Feedback (Q3460714) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
