Counting Minimal Dominating Sets (Q2988832): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-55911-7_24
+Normal rank
@@ Property / OpenAlex ID @@
+W2601850727
@@ Property / OpenAlex ID: W2601850727 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms to Enumerate Hypergraph Transversals
+Normal rank
@@ Property / cites work @@
+Linear delay enumeration and monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Block interpolation: a framework for tight exponential-time counting complexity
+Normal rank
@@ Property / cites work @@
+Approximating the permanent of graphs with large factors
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the counting complexity of propositional circumscription
+Normal rank
@@ Property / cites work @@
+Computational aspects of monotone dualization: a brief survey
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Enumeration of Minimal Dominating Sets and Related Notions
+Normal rank
@@ Property / cites work @@
+Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
+Normal rank
@@ Property / cites work @@
+Dominating Set Counting in Graph Classes
@@ Property / cites work: Dominating Set Counting in Graph Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Recurrence relations and splitting formulas for the domination polynomial
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank