Computational study on dominating set problem of planar graphs
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Combinatorial Optimization and Applications |
| Subtitle of host publication | Second International Conference, COCOA 2008, Proceedings |
| Publisher | Springer Verlag |
| Pages | 89-102 |
| Volume | 5165 LNCS |
| ISBN (Print) | 3540850961, 9783540850960 |
| Publication status | Published - 2008 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5165 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Title | 2nd International Conference on Combinatorial Optimization and Applications, COCOA 2008 |
|---|---|
| Place | Canada |
| City | St. John's, NL |
| Period | 21 - 24 August 2008 |
Link(s)
Abstract
Recently, there has been significant theoretical progress towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the problem on a planar graph with n vertices and dominating number k can be solved in time using tree/branch-decomposition based algorithms, where c is some constant. However there has been no computational study report on the practical performances of the time algorithms. In this paper, we report computational results of Fomin and Thilikos algorithm which uses the branch-decomposition based approach. The computational results show that the algorithm can solve the DOMINATING SET problem of large planar graphs in a practical time for the class of graphs with small branchwidth. For the class of graphs with large branchwidth, the size of instances that can be solved by the algorithm in a practical time is limited to a few hundreds edges. The practical performances of the algorithm coincide with the theoretical analysis of the algorithm. The results of this paper suggest that the branch-decomposition based algorithms can be practical for some applications on planar graphs. © Springer-Verlag Berlin Heidelberg 2008.
Research Area(s)
- Branch-decomposition, Computational study, Data reduction, Fixed-parameter algorithms, PLANAR DOMINATING SET
Citation Format(s)
Computational study on dominating set problem of planar graphs. / Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua.
Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, Proceedings. Vol. 5165 LNCS Springer Verlag, 2008. p. 89-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5165 LNCS).Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with ISBN/ISSN) › peer-review
