Pages that link to "Item:Q5244687"

The following pages link to A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687):

Displaying 2 items.

• Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
• An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)