Connected dominating set. Theory and applications
DOI10.1007/978-1-4614-5242-3zbMATH Open1278.05003OpenAlexW564518845MaRDI QIDQ436191FDOQ436191
Publication date: 30 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5242-3
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (42)
- Predicting positon solutions of a family of nonlinear Schrödinger equations through deep learning algorithm
- Graph domination, coloring and cliques in telecommunications
- Greedy approximation for the minimum connected dominating set with labeling
- Semitotal domination on AT-free graphs and circle graphs
- Statistical mechanics of the minimum dominating set problem
- Connected dominating sets on dynamic geometric graphs
- Linear separation of connected dominating sets in graphs
- Online dominating set
- Connected Domination
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- On imposing connectivity constraints in integer programs
- Exact algorithms for the minimum \(s\)-club partitioning problem
- On approximating (connected) 2-edge dominating set by a tree
- Connected Set Cover Problem and Its Applications
- Title not available (Why is that?)
- Improved budgeted connected domination and budgeted edge-vertex domination
- A proof of a conjecture on the connected domination number
- Data-driven soliton mappings for integrable fractional nonlinear wave equations via deep learning with Fourier neural operator
- Parallel algorithm for minimum partial dominating set in unit disk graph
- Exact and heuristic algorithms for the weighted total domination problem
- Making a dominating set of a graph connected
- Minimum connected dominating set and backbone of a random graph
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- Nordhaus-Gaddum-type results on the connected edge domination number
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- Approximation algorithms for connected maximum cut and related problems
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems
- Optimal control of a 2D diffusion-advection process with a team of mobile actuators under jointly optimal guidance
- Covariant bit threads
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- Wireless networking, dominating and packing
- Optimal guidance and estimation of a 2D diffusion-advection process by a team of mobile sensors
- Approximation algorithms for the connected sensor cover problem
- A game theoretic approach for minimal connected dominating set
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Construction of minimum edge-fault tolerant connected dominating set in a general graph
- Robust Connectivity of Graphs on Surfaces
- The Optimal Design of Low-Latency Virtual Backbones
- Local planar domination revisited
- The \(k\)-hop connected dominating set problem: approximation and hardness
- Title not available (Why is that?)
This page was built for publication: Connected dominating set. Theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436191)
