Pages that link to "Item:Q5917933"
From MaRDI portal
The following pages link to Constant-time distributed dominating set approximation (Q5917933):
Displayed 16 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks (Q635294) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Membrane computing to enhance time efficiency of minimum dominating set (Q2630783) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Cellular Automata and Wireless Sensor Networks (Q4686657) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- Structuring unreliable radio networks (Q5919151) (← links)