A linear kernel for a planar connected dominating set (Q534569): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5895909
@@ Property / zbMATH DE Number: 5895909 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connected dominating set
@@ Property / zbMATH Keywords: connected dominating set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reduce or refine
@@ Property / zbMATH Keywords: reduce or refine / 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.tcs.2010.10.045
+Normal rank
@@ Property / OpenAlex ID @@
+W2177196747
@@ Property / OpenAlex ID: W2177196747 / 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 @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Planar Feedback Vertex Set
@@ Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
+Normal rank
@@ Property / cites work @@
+Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4633817
@@ Property / cites work: Q4633817 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:534569