Pages that link to "Item:Q436191"
From MaRDI portal
The following pages link to Connected dominating set. Theory and applications (Q436191):
Displayed 36 items.
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Statistical mechanics of the minimum dominating set problem (Q888266) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Online dominating set (Q1741855) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Optimal control of a 2D diffusion-advection process with a team of mobile actuators under jointly optimal guidance (Q2065217) (← links)
- Optimal guidance and estimation of a 2D diffusion-advection process by a team of mobile sensors (Q2071958) (← links)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- Local planar domination revisited (Q2097345) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Revisiting connected dominating sets: an almost optimal local information algorithm (Q2414868) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Data-driven soliton mappings for integrable fractional nonlinear wave equations via deep learning with Fourier neural operator (Q2679950) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Connected Domination (Q3384607) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- (Q5090485) (← links)
- (Q5136272) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Covariant bit threads (Q6055787) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)