On the public citation graph
On Approximating Minimum 3-Connected $m$-Dominating Set Problem in Unit Disk Graph
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-88582-5_15openalex-snapshot
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network
inferredcites →https://doi.org/10.1007/978-3-540-88582-5_52openalex-snapshot
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s10878-007-9124-yopenalex-snapshot
On minimum m-connected k-dominating set problem in unit disc graphs
inferredcites →https://doi.org/10.1007/s10878-010-9346-2openalex-snapshot
On the construction of k-connected m-dominating sets in wireless networks
inferredcites →https://doi.org/10.1007/s10878-014-9720-6openalex-snapshot
A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem
inferredcites →https://doi.org/10.1016/j.adhoc.2014.10.013openalex-snapshot
Construction of higher spectral efficiency virtual backbone in wireless networks
inferredcites →https://doi.org/10.1016/j.tcs.2007.05.025openalex-snapshot
On approximation algorithms of k -connected m -dominating sets in disk graphs
inferredcites →https://doi.org/10.1109/infcom.2010.5462105openalex-snapshot
A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks
inferredcites →https://doi.org/10.1109/infocom.2015.7218561openalex-snapshot
A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition
inferredcites →https://doi.org/10.1109/ipdps.2005.302openalex-snapshot
On Constructing k-Connected k-Dominating Set in Wireless Networks
inferredcites →https://doi.org/10.1109/milcom.2007.4454774openalex-snapshot
Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tmc.2010.55openalex-snapshot
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs
inferredcites →https://doi.org/10.1109/tnet.2011.2164620openalex-snapshot
Exploiting Data Fusion to Improve the Coverage of Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tnet.2012.2227791openalex-snapshot
On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks
inferredcites →https://doi.org/10.1109/tpds.2008.74openalex-snapshot
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
inferredcites →https://doi.org/10.1109/twc.2009.051053openalex-snapshot
On the construction of 2-connected virtual backbone in wireless networks
inferredcites →https://doi.org/10.1109/wasa.2007.148openalex-snapshot
Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1145/1374618.1374631openalex-snapshot
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
inferredcites →https://doi.org/10.1145/1374718.1374720openalex-snapshot
Trade-off scheme for fault tolerant connected dominating sets on size and diameter
inferredcites →https://doi.org/10.1145/313451.313525openalex-snapshot
The broadcast storm problem in a mobile ad hoc network
inferredcites →https://doi.org/10.37236/872openalex-snapshot
A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-73317-3_27openalex-snapshot
Distributed Construction of Fault-Tolerance Virtual Backbone Network for UAV Cluster Network
inferred← citeshttps://doi.org/10.1007/s11227-023-05180-9openalex-snapshot
Construction of node- and link-fault-tolerant virtual backbones in wireless networks
inferred← citeshttps://doi.org/10.1007/s11227-023-05799-8openalex-snapshot
On the construction of quality extended virtual backbones in wireless sensor networks using cooperative communication
inferred← citeshttps://doi.org/10.1016/j.comcom.2024.107952openalex-snapshot
On construction of quality virtual backbone in wireless networks using cooperative communication
inferred← citeshttps://doi.org/10.1080/02533839.2026.2659786openalex-snapshot
Restoring 2-edge-connected m-edge dominating sets in unit disk graphs with failed edges
inferred← citeshttps://doi.org/10.1109/icccn.2016.7568483openalex-snapshot
A Simpler Constant Factor Approximation for the k-Connected m-Domination Set Problem in Unit Disk Graph
inferred← citeshttps://doi.org/10.1109/msn63567.2024.00129openalex-snapshot
An Algorithm for Constructing Virtual Backbone Network under Routing Cost Constraint for Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/rtcsa.2016.49openalex-snapshot
On Scheduling Real-Time Multi-item Query with Network Coding in Multi-RSU Vehicular Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3030930openalex-snapshot
Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3524945openalex-snapshot
Construction of Virtual Backbones With Edge Fault Tolerance in Wireless Networks With Multiple Communication Modes
inferred← citeshttps://doi.org/10.1109/tmc.2020.3048960openalex-snapshot
On the Computation of Virtual Backbones With Fault Tolerance in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2016.2561901openalex-snapshot
A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph
inferred← citeshttps://doi.org/10.1109/tnet.2017.2690359openalex-snapshot
A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2017.2780262openalex-snapshot
On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2025.3606864openalex-snapshot
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
inferred← citeshttps://doi.org/10.1109/tnsm.2026.3686606openalex-snapshot
Construction and Post-Failure Reconstruction of Virtual Backbone Based on Regional Risk Difference in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/3231053.3231080openalex-snapshot
Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology control
inferred← citeshttps://doi.org/10.1155/2021/5977781openalex-snapshot
Construction of Quality Virtual Backbones with Link Fault Tolerance in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3390/s19081919openalex-snapshot
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
inferred← citeshttps://doi.org/10.4018/ijwnbt.2020070101openalex-snapshot
A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.