Pages that link to "Item:Q5138380"

The following pages link to An efficient distributed algorithm for constructing small dominating sets (Q5138380):

Displaying 15 items.

• Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
• Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
• Distributed algorithms for random graphs (Q888436) (← links)
• Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
• Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
• Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
• Leveraging Linial’s Locality Limit (Q3540245) (← links)
• On the Microscopic View of Time and Messages (Q4686647) (← links)
• Distributed Spanner Approximation (Q4997324) (← links)
• (Q5090485) (← links)
• Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
• Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks (Q5233841) (← links)
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
• Beep-and-sleep: message and energy efficient set cover (Q5918712) (← links)
• Beep-and-sleep: message and energy efficient set cover (Q5925658) (← links)