Pages that link to "Item:Q818109"

The following pages link to Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109):

Displaying 44 items.

• An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
• Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks (Q393036) (← links)
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
• Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
• On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
• An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
• Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
• An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
• A new bound on maximum independent set and minimum connected dominating set in unit disk graphs (Q887860) (← links)
• A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks (Q896118) (← links)
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
• Making a dominating set of a graph connected (Q1656909) (← links)
• Colored spanning graphs for set visualization (Q1699297) (← links)
• Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm (Q1701611) (← links)
• The connected disk covering problem (Q1702836) (← links)
• Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
• The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks (Q1958638) (← links)
• Improved solution to data gathering with mobile mule (Q2205629) (← links)
• The complexity of symmetric connectivity in directional wireless sensor networks (Q2307492) (← links)
• Combinatorial properties of Farey graphs (Q2333787) (← links)
• Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
• Message and time efficient multi-broadcast schemes (Q2513670) (← links)
• On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460) (← links)
• SPANNING PROPERTIES OF GRAPHS INDUCED BY DIRECTIONAL ANTENNAS (Q2864850) (← links)
• On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (Q2970204) (← links)
• ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM (Q3007757) (← links)
• Connected Domination (Q3384607) (← links)
• A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET (Q3569287) (← links)
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
• Super domination in trees (Q5083859) (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
• TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988) (← links)
• Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)
• (Q5240127) (← links)
• A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
• The wake up dominating set problem (Q5899558) (← links)
• 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
• Improved algorithms in directional wireless sensor networks (Q6046631) (← links)
• COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB (Q6158062) (← links)