Below All Subsets for Minimal Connected Dominating Set (Q4683902): Difference between revisions

@@ Property / arXiv ID @@
+.00840
@@ Property / arXiv ID: 1611.00840 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for connected red-blue dominating set
+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 @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating minimal connected dominating sets in graphs of bounded chordality
+Normal rank
@@ Property / cites work @@
+Q2744679
@@ Property / cites work: Q2744679 / rank @@
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2548944478
@@ Property / OpenAlex ID: W2548944478 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129189621
@@ Property / Wikidata QID: Q129189621 / rank @@
+Normal rank