Pages that link to "Item:Q4989343"
From MaRDI portal
The following pages link to Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343):
Displaying 6 items.
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Q2962573) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- Fast distributed consensus seeking in large-scale and high-density multi-agent systems with connectivity maintenance (Q6195451) (← links)
