On connected dominating sets of restricted diameter (Q2356248): Difference between revisions

@@ Property / author @@
+Vladimir L. Boginski
@@ Property / author: Vladimir L. Boginski / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2013.11.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2071041127
@@ Property / OpenAlex ID: W2071041127 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Complete description of forbidden subgraphs in the structural domination problem
+Normal rank
@@ Property / cites work @@
+Dominating cliques in \(P_ 5\)-free graphs
@@ Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227911
@@ Property / cites work: Q4227911 / rank @@
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum \(k\)-club problem in an undirected graph
+Normal rank
@@ Property / cites work @@
+Q3694712
@@ Property / cites work: Q3694712 / rank @@
+Normal rank
@@ Property / cites work @@
+On domination problems for permutation and other graphs
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Dominating cliques in graphs
@@ Property / cites work: Dominating cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem.
+Normal rank
@@ Property / cites work @@
+The maximum-leaf spanning tree problem: Formulations and facets
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of domination problems in circle graphs
+Normal rank
@@ Property / cites work @@
+Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the minimum dominating clique problem
+Normal rank
@@ Property / cites work @@
+Reformulations and solution algorithms for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+On clique relaxation models in network analysis
@@ Property / cites work: On clique relaxation models in network analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+On dominating sets whose induced subgraphs have a bounded diameter
+Normal rank
@@ Property / cites work @@
+The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
+Normal rank
@@ Property / cites work @@
+Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank