Computational study for planar connected dominating set problem

Authors:
Marjan Marzban;Qian-Ping Gu;Xiaohua Jia
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;Department of Computer Science, City University of Hong Kong
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 13
Cited 0

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

SIAM Journal on Computing
Dynamic programming and fast matrix multiplication

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Optimal branch-decomposition of planar graphs in O(n3) Time

ACM Transactions on Algorithms (TALG)
New upper bounds on the decomposability of planar graphs

Journal of Graph Theory
Computational study on planar dominating set problem

Theoretical Computer Science
Computing branch decomposition of large planar graphs

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Connectivity is not a limit for kernelization: planar connected dominating set

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. [ESA2005, LNCS3669, pp95-106] introduce a new technique to generate 2O(√n) time and fixed-parameter algorithms for a number of nonlocal hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results show that the size of instances can be solved by the algorithm mainly depends on the branchwidth of the instances, coinciding with the theoretical result. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.