Constructing Minimum Connected Dominating Set: Algorithmic Approach

International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks
doi 10.5121/jgraphoc.2010.2305
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Academy and Industry Research Collaboration Center (AIRCC)

Related search

A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network

International Journal of Distributed Sensor Networks
Computer NetworksEngineeringCommunications
2016English

Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

Mathematics
Mathematics
2019English

Distributed Construction of Minimum Connected Dominating Set in Wireless Sensor Network Using Two-Hop Information

Computer Networks
Computer NetworksCommunications
2017English

Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset

Journal of Communications
2016English

A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

Journal of Optimization
2017English

Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks

2009English

Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs

2012English

A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks

2014English

Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks

Journal of Computing and Information Technology
Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy