Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
| dc.creator | Philip, Geevarghese | |
| dc.creator | Raman, Venkatesh | |
| dc.creator | Sikdar, Somnath | |
| dc.date | 2009-03-26 | |
| dc.date | 2009-05-15 | |
| dc.date.accessioned | 2026-07-07T13:14:51Z | |
| dc.date.available | 2026-07-07T13:14:51Z | |
| dc.description | We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K_{i,j} as a subgraph, for any fixed i, j >= 1. This strictly includes every class of graphs for which this problem has been previously shown to have FPT algorithms and/or polynomial kernels. In particular, our result implies that the problem restricted to bounded- degenerate graphs has a polynomial kernel, solving an open problem posed by Alon and Gutner. | |
| dc.description | 12 pages, 1 figure, 1 table | |
| dc.identifier | https://arxiv.org/abs/0903.4521 | |
| dc.identifier | http://arxiv.org/abs/0903.4521 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230309 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels | |
| dc.type | text |