Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615): Difference between revisions

@@ 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.1007/978-3-642-16926-7_10
+Normal rank
@@ Property / OpenAlex ID @@
+W1690875420
@@ Property / OpenAlex ID: W1690875420 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Planar Capacitated Dominating Set Is W[1]-Hard
@@ Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination Faster Than O(2 n )
@@ Property / cites work: Capacitated Domination Faster Than O(2 n ) / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connected Dominating Set Faster Than 2 n
@@ Property / cites work: Solving Connected Dominating Set Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning into Sets of Bounded Cardinality
@@ Property / cites work: Partitioning into Sets of Bounded Cardinality / rank @@
+Normal rank
@@ Property / cites work @@
+Inclusion/Exclusion Meets Measure and Conquer
@@ Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank @@
+Normal rank