New analysis and computational study for the planar connected dominating set problem (Q328712): Difference between revisions

@@ Property / describes a project that uses @@
+PIGALE
@@ Property / describes a project that uses: PIGALE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LEDA
@@ Property / describes a project that uses: LEDA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / 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.1007/s10878-015-9871-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2013280510
@@ Property / OpenAlex ID: W2013280510 / 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 @@
+Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
+Normal rank
@@ Property / cites work @@
+Experiments on data reduction for optimal domination in networks
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+Faster Algorithms on Branch and Clique Decompositions
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Fast Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms
@@ Property / cites work: Subexponential parameterized algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
+Normal rank
@@ Property / cites work @@
+Catalan structures and dynamic programming in \(H\)-minor-free graphs
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On Hadwiger's Number and the Stability Number
@@ Property / cites work: On Hadwiger's Number and the Stability Number / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding Up Dynamic Programming with Representative Sets
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+New upper bounds on the decomposability of planar graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal branch-decomposition of planar graphs in             <i>O</i>             (             <i>n</i>             <sup>3</sup>             ) Time
+Normal rank
@@ Property / cites work @@
+Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Branch Decompositions I: The Ratcatcher
@@ Property / cites work: Planar Branch Decompositions I: The Ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Branch Decompositions II: The Cycle Method
@@ Property / cites work: Planar Branch Decompositions II: The Cycle Method / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate tree decompositions of planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernel for Planar Connected Dominating Set
@@ Property / cites work: Linear Kernel for Planar Connected Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+Computational study on planar dominating set problem
+Normal rank
@@ Property / cites work @@
+Computational Study for Planar Connected Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank