Computational study on planar dominating set problem
From MaRDI portal
Recommendations
- Computational Study on Dominating Set Problem of Planar Graphs
- Computational study for planar connected dominating set problem
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- scientific article; zbMATH DE number 1929955
- New analysis and computational study for the planar connected dominating set problem
Cites work
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1929955 (Why is no real title available?)
- scientific article; zbMATH DE number 1834643 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- A threshold of ln n for approximating set cover
- Algorithms – ESA 2005
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation algorithms for combinatorial problems
- Call routing and the ratcatcher
- Computational Study on Dominating Set Problem of Planar Graphs
- Differentials in graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Domination in Graphs Applied to Electric Power Networks
- Dynamic Programming and Fast Matrix Multiplication
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
- Experimental analysis of Heuristic algorithms for the dominating set problem
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Experiments on data reduction for optimal domination in networks
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. X: Obstructions to tree-decomposition
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Matrix multiplication via arithmetic progressions
- New upper bounds on the decomposability of planar graphs
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Polynomial-time data reduction for dominating set
- Random sampling of large planar maps and convex polyhedra
- Subexponential parameterized algorithms
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(7)- scientific article; zbMATH DE number 1617251 (Why is no real title available?)
- Computational study on a PTAS for planar dominating set problem
- A strengthened analysis of an algorithm for dominating set in planar graphs
- Computational Study on Dominating Set Problem of Planar Graphs
- New analysis and computational study for the planar connected dominating set problem
- Practical algorithms for branch-decompositions of planar graphs
- Computational study for planar connected dominating set problem
This page was built for publication: Computational study on planar dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040587)
